Searcharxiv⌕ Search

arXiv subjects

Tianyu Wu

Publications and source records attributed to Tianyu Wu.

30 records · Page 2Linked to original sources

Molecular Joint Representation Learning via Multi-modal Information

In recent years, artificial intelligence has played an important role on accelerating the whole process of drug discovery. Various of molecular representation schemes of different modals (e.g. textual sequence or graph) are developed. By digitally encoding them, different chemical information can be learned through corresponding network structures. Molecular graphs and Simplified Molecular Input Line Entry System (SMILES) are popular means for molecular representation learning in current. Previous works have done attempts by combining both of them to solve the problem of specific information loss in single-modal representation on various tasks. To further fusing such multi-modal imformation, the correspondence between learned chemical feature from different representation should be considered. To realize this, we propose a novel framework of molecular joint representation learning via Multi-Modal information of SMILES and molecular Graphs, called MMSG. We improve the self-attention mechanism by introducing bond level graph representation as attention bias in Transformer to reinforce feature correspondence between multi-modal information. We further propose a Bidirectional Message Communication Graph Neural Network (BMC GNN) to strengthen the information flow aggregated from graphs for further combination. Numerous experiments on public property prediction datasets have demonstrated the effectiveness of our model.

cs.LG↗

Non-abelian gauge fields in circuit systems

Circuits can provide a platform to study novel physics and have been used, for example, to explore various topological phases. Gauge fields-particularly, non-Abelian gauge fields-can play a pivotal role in the design and modulation of novel physical states, but their circuit implementation has so far been limited. Here we show that non-Abelian gauge fields can be synthesized in circuits created from building blocks that consist of capacitors, inductors and resistors. With these building blocks, we create circuit designs for the spin-orbit interaction and the topological Chern state, which are phenomena that represent non-Abelian gauge fields in momentum space. We also use the approach to design non-reciprocal circuits that can be used to implement the non-Abelian Aharonov-Bohm effect in real space.

cond-mat.mes-hall↗

A Data Science Pipeline for Algorithmic Trading: A Comparative Study of Applications for Finance and Cryptoeconomics

Recent advances in Artificial Intelligence (AI) have made algorithmic trading play a central role in finance. However, current research and applications are disconnected information islands. We propose a generally applicable pipeline for designing, programming, and evaluating the algorithmic trading of stock and crypto assets. Moreover, we demonstrate how our data science pipeline works with respect to four conventional algorithms: the moving average crossover, volume-weighted average price, sentiment analysis, and statistical arbitrage algorithms. Our study offers a systematic way to program, evaluate, and compare different trading strategies. Furthermore, we implement our algorithms through object-oriented programming in Python3, which serves as open-source software for future academic research and applications.

cs.HC↗

Deploying self-supervised learning in the wild for hybrid automatic speech recognition

Self-supervised learning (SSL) methods have proven to be very successful in automatic speech recognition (ASR). These great improvements have been reported mostly based on highly curated datasets such as LibriSpeech for non-streaming End-to-End ASR models. However, the pivotal characteristics of SSL is to be utilized for any untranscribed audio data. In this paper, we provide a full exploration on how to utilize uncurated audio data in SSL from data pre-processing to deploying an streaming hybrid ASR model. More specifically, we present (1) the effect of Audio Event Detection (AED) model in data pre-processing pipeline (2) analysis on choosing optimizer and learning rate scheduling (3) comparison of recently developed contrastive losses, (4) comparison of various pre-training strategies such as utilization of in-domain versus out-domain pre-training data, monolingual versus multilingual pre-training data, multi-head multilingual SSL versus single-head multilingual SSL and supervised pre-training versus SSL. The experimental results show that SSL pre-training with in-domain uncurated data can achieve better performance in comparison to all the alternative out-domain pre-training strategies.

cs.SD↗

3D Reconstruction from public webcams

We investigate the possibility of 3D scene reconstruction from two or more overlapping webcam streams. A large, and growing, number of webcams observe places of interest and are publicly accessible. The question naturally arises: can we make use of this free data source for 3D computer vision? It turns out that the task to reconstruct scene structure from webcam streams is very different from standard structure-from-motion (SfM), and conventional SfM pipelines fail. In the webcam setting there are very few views of the same scene, in most cases only the minimum of two. These viewpoints often have large baselines and/or scale differences, their overlap is rather limited, and besides unknown internal and external calibration also their temporal synchronisation is unknown. On the other hand, they record rather large fields of view continuously over long time spans, so that they regularly observe dynamic objects moving through the scene. We show how to leverage recent advances in several areas of computer vision to adapt SfM reconstruction to this particular scenario and reconstruct the unknown camera poses, the 3D scene structure, and the 3D trajectories of dynamic objects.

cs.CV↗

Ice Monitoring in Swiss Lakes from Optical Satellites and Webcams using Machine Learning

Continuous observation of climate indicators, such as trends in lake freezing, is important to understand the dynamics of the local and global climate system. Consequently, lake ice has been included among the Essential Climate Variables (ECVs) of the Global Climate Observing System (GCOS), and there is a need to set up operational monitoring capabilities. Multi-temporal satellite images and publicly available webcam streams are among the viable data sources to monitor lake ice. In this work we investigate machine learning-based image analysis as a tool to determine the spatio-temporal extent of ice on Swiss Alpine lakes as well as the ice-on and ice-off dates, from both multispectral optical satellite images (VIIRS and MODIS) and RGB webcam images. We model lake ice monitoring as a pixel-wise semantic segmentation problem, i.e., each pixel on the lake surface is classified to obtain a spatially explicit map of ice cover. We show experimentally that the proposed system produces consistently good results when tested on data from multiple winters and lakes. Our satellite-based method obtains mean Intersection-over-Union (mIoU) scores >93%, for both sensors. It also generalises well across lakes and winters with mIoU scores >78% and >80% respectively. On average, our webcam approach achieves mIoU values of 87% (approx.) and generalisation scores of 71% (approx.) and 69% (approx.) across different cameras and winters respectively. Additionally, we put forward a new benchmark dataset of webcam images (Photi-LakeIce) which includes data from two winters and three cameras.

cs.CV↗

Cyclic Coordinate Update Algorithms for Fixed-Point Problems: Analysis and Applications

Many problems reduce to the fixed-point problem of solving $x=T(x)$. To this problem, we apply the coordinate-update algorithms, which update only one or a few components of $x$ at each step. When each update is cheap, these algorithms are faster than the full fixed-point iteration (which updates all the components). In this paper, we focus on the coordinate-update algorithms based on the cyclic selection rules, where the ordering of coordinates in each cycle is arbitrary. These algorithms are fast, but their convergence is unknown in the fixed-point setting. When $T$ is a nonexpansive operator and has a fixed point, we show that the sequence of coordinate-update iterates converges to a fixed point under proper step sizes. This result applies to the primal-dual coordinate-update algorithms, which have applications to optimization problems with nonseparable nonsmooth objectives, as well as global linear constraints. Numerically, we apply coordinate-update algorithms with the cyclic, shuffled cyclic, and random selection rules to $\ell_1$ robust least squares, a CT image reconstruction problem, as well as nonnegative matrix factorization. They converge much faster than the standard fixed-point iteration. Among the three rules, cyclic and shuffled cyclic rules are overall faster than the random rule.

math.OC↗

Decentralized Consensus Optimization with Asynchrony and Delays

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can compute and communicate independently at different times, for different durations, with the information it has even if the latest information from its neighbors is not yet available. Such an asynchronous algorithm reduces the time that agents would otherwise waste idle because of communication delays or because their neighbors are slower. It also eliminates the need for a global clock for synchronization. Mathematically, the algorithm involves both primal and dual variables, uses fixed step-size parameters, and provably converges to the exact solution under a bounded delay assumption and a random agent assumption. When running synchronously, the algorithm performs just as well as existing competitive synchronous algorithms such as PG-EXTRA, which diverges without synchronization. Numerical experiments confirm the theoretical findings and illustrate the performance of the proposed algorithm.

math.OC↗

Expander Graph and Communication-Efficient Decentralized Optimization

In this paper, we discuss how to design the graph topology to reduce the communication complexity of certain algorithms for decentralized optimization. Our goal is to minimize the total communication needed to achieve a prescribed accuracy. We discover that the so-called expander graphs are near-optimal choices. We propose three approaches to construct expander graphs for different numbers of nodes and node degrees. Our numerical results show that the performance of decentralized optimization is significantly better on expander graphs than other regular graphs.

math.OC↗

Coordinate Friendly Structures, Algorithms and Applications

This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblems, where each updates one, or a small block of, variables while fixing others. These methods can deal with linear and nonlinear mappings, smooth and nonsmooth functions, as well as convex and nonconvex problems. In addition, they are easy to parallelize. The great performance of coordinate update methods depends on solving simple sub-problems. To derive simple subproblems for several new classes of applications, this paper systematically studies coordinate-friendly operators that perform low-cost coordinate updates. Based on the discovered coordinate friendly operators, as well as operator splitting techniques, we obtain new coordinate update algorithms for a variety of problems in machine learning, image processing, as well as sub-areas of optimization. Several problems are treated with coordinate update for the first time in history. The obtained algorithms are scalable to large instances through parallel and even asynchronous computing. We present numerical examples to illustrate how effective these algorithms are.

math.OC↗

Design and Analysis of Multi-User SDMA Systems with Noisy Limited CSIT Feedback

In this paper, we consider spatial-division multiple-access (SDMA) systems with one base station with multiple antennae and a number of single antenna mobiles under noisy limited CSIT feedback. We propose a robust noisy limited feedback design for SDMA systems. The solution consists of a real-time robust SDMA precoding, user selection and rate adaptation as well as an offline feedback index assignment algorithm. The index assignment problem is cast into a Traveling Sales Man problem (TSP). Based on the specific structure of the feedback constellation and the precoder, we derive a low complex but asymptotically optimal solution. Simulation results show that the proposed framework has significant goodput gain compared to the traditional naive designs under noisy limited feedback channel. Furthermore, we show that despite the noisy feedback channel, the average SDMA system goodput grows with the number of feedback bits in the interference limited regime while in noise limited regime increases linearly with the number of transmit antenna and the forward channel SNR.

cs.IT↗

A Low-Overhead Energy Detection Based Cooperative Sensing Protocol for Cognitive Radio Systems

Cognitive radio and dynamic spectrum access represent a new paradigm shift in more effective use of limited radio spectrum. One core component behind dynamic spectrum access is the sensing of primary user activity in the shared spectrum. Conventional distributed sensing and centralized decision framework involving multiple sensor nodes is proposed to enhance the sensing performance. However, it is difficult to apply the conventional schemes in reality since the overhead in sensing measurement and sensing reporting as well as in sensing report combining limit the number of sensor nodes that can participate in distributive sensing. In this paper, we shall propose a novel, low overhead and low complexity energy detection based cooperative sensing framework for the cognitive radio systems which addresses the above two issues. The energy detection based cooperative sensing scheme greatly reduces the quiet period overhead (for sensing measurement) as well as sensing reporting overhead of the secondary systems and the power scheduling algorithm dynamically allocate the transmission power of the cooperative sensor nodes based on the channel statistics of the links to the BS as well as the quality of the sensing measurement. In order to obtain design insights, we also derive the asymptotic sensing performance of the proposed cooperative sensing framework based on the mobility model. We show that the false alarm and mis-detection performance of the proposed cooperative sensing framework improve as we increase the number of cooperative sensor nodes.

cs.IT↗