Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

62124185247 · Jun 202019922001200920172026
48 results for topological attention

Topological attention improves forecasting of univariate time series.

problem Forecasting univariate time series using local topological features.
method Topological attention mechanism that integrates local topological properties into forecasting models.
result Topological attention leads to state-of-the-art performance on the M4 benchmark.

A new method for graph-structured data improves transformer performance by incorporating topology.

problem Improving transformer performance on graph-structured data.
method Parameterizing topological masks as a learnable function of a weighted adjacency matrix, approximated with graph random features.
result Efficient masking algorithms provide strong performance gains for tasks on image and point cloud data.

Attention-based models have recently shown great performance on a range of tasks, such as speech recognition, machine translation, and image captioning due to their ability to summarize relevant information that expands through the entire length of an input sequence. In this paper, we analyze the usage of attention mec…

2017-10-28abs ↗pdf ↗

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

This is a survey article for the forthcoming `A Concise Encyclopedia of Knot Theory.' We focus on the topology of spatial graphs with few vertices and edges, paying particular attention to Brunnian θθ-graphs.

2019-02-05abs ↗pdf ↗

Reformulates binary classification on manifolds using Yang-Mills-Higgs theory.

problem Binary classification on non-contractible spaces.
method Formulates binary classification as a Yang-Mills-Higgs variational problem, encoding data as a functor.
result Reveals a geometric interpretation of binary classification and solves XOR on the torus.

Topologically protected vortex knots and links are proposed and proven.

problem Decaying of tangled vortex structures through local reconnections and strand crossings.
method Proposed and proven topologically protected vortex structures using non-Abelian topological vortices.
result Existence of topologically protected Q8Q_8-colored links and classification using the QQ-invariant.

Paper introduces a conformer-based system for streaming language identification in long-form speech.

problem Language identification in long-form audio.
method Conformer layers with attentive temporal pooling and domain adaptation.
result Conformer-based models significantly outperform LSTM and transformer models.

Improved neural transducer model outperforms attention model on longer sequences.

problem Improving performance of neural transducer models.
method Comparison of training criteria (marginalization vs. maximum approximation), model generalization, and output label topology.
result Final transducer model outperforms attention model by over 6% relative WER on Switchboard 300h.

TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.

problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.

GISST interprets GNNs by combining attention and sparsity for graph structure and node feature importance.

problem Lack of joint consideration of graph structure and node features in GNN interpretation.
method Model-agnostic framework using attention mechanism and sparsity regularization.
result GISST achieves superior node feature and edge explanation precision in synthetic and real-world datasets.

We study the topology of compact manifolds with a Lie group action for which there are only finitely many non-principal orbits, and describe the possible orbit spaces which can occur. If some non-principal orbit is singular, we show that the Lie group action must have odd cohomogeneity. We pay special attention to mani…

2011-06-17abs ↗pdf ↗

Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…

2015-10-08abs ↗pdf ↗

CT improves neural network performance on cell complex data.

problem Improving predictive performance of neural networks on complex data.
method Introducing the Cellular Transformer (CT) that generalizes graph-based transformers to cell complexes.
result CT achieves state-of-the-art performance on cell complex datasets without complex enhancements.

Study on minimal torsion topological generators for mapping class groups of infinite-type surfaces.

problem Minimal topological generating sets of mapping class groups consisting of torsion elements.
method Investigation of minimal topological generating sets for Map(S(n))\mathrm{Map}(S(n)) consisting entirely of torsion elements, with special attention to involutions.
result Minimal topological generating sets for Map(S(n))\mathrm{Map}(S(n)) consisting of torsion elements are found for various nn.

AdaCAD improves semi-supervised classification by focusing on intra-class nodes.

problem Improving semi-supervised classification by addressing inter-class connections in graphs.
method AdaCAD uses a class-attentive diffusion process to adaptively aggregate nodes based on their class similarity.
result AdaCAD significantly outperforms state-of-the-art methods in semi-supervised classification.

We consider the quantum Teichmuller space of the punctured surface introduced by Chekhov-Fock-Kashaev, and formalize it as a noncommutative deformation of the space of algebraic functions on the Teichmuller space of the surface. In order to apply it in 3-dimensional topology, we put more attention to the details involv…

2004-08-26abs ↗pdf ↗

Develops a mean-field theory for multi-head self-attention under cross-entropy training.

problem Mean-field analysis of multi-head self-attention under cross-entropy training.
method Mean-field theory for a simplified single-layer causal multi-head self-attention model.
result Proves a static finite-head approximation bound for the optimal risk.

The Turaev genus of a knot is a topological measure of how far a given knot is from being alternating. Recent work by several authors has focused attention on this interesting invariant. We discuss how the Turaev genus is related to other knot invariants, including the Jones polynomial, knot homology theories, and ribb…

2014-06-08abs ↗pdf ↗

Advanced methods of applying deep learning to structured data such as graphs have been proposed in recent years. In particular, studies have focused on generalizing convolutional neural networks to graph data, which includes redefining the convolution and the downsampling (pooling) operations for graphs. The method of …

2019-04-17abs ↗pdf ↗

A new topology improves decentralized learning efficiency and accuracy.

problem Finding efficient decentralized learning topologies with fast consensus and low maximum degree.
method Proposed the Base-(k+1)(k + 1) Graph topology for decentralized learning.
result The Base-(k+1)(k + 1) Graph enables faster convergence and better communication efficiency than the exponential graph.

Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. …

2019-04-04abs ↗pdf ↗

We study the problem of prescribing the Paneitz curvature on higher dimensional spheres. Particular attention is paid to the blow-up points, i.e. the critical points at infinity of the corresponding variational problem. Using topological tools and a careful analysis of the gradient flow lines in the neighborhood of suc…

2004-12-06abs ↗pdf ↗

Power system studies require the topological structures of real-world power networks; however, such data is confidential due to important security concerns. Thus, power grid synthesis (PGS), i.e., creating realistic power grids that imitate actual power networks, has gained significant attention. In this letter, we cas…

2019-01-17abs ↗pdf ↗

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to simplicial complexes, among them stand out coboundary expansion and topological expand…

2014-08-27abs ↗pdf ↗

A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.

problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.

New method identifies network dynamics and noise structure.

problem Estimating network and disturbance topologies in dynamic systems.
method Extended multi-step Sequential Linear Regression and Weighted Null Space Fitting methods.
result Consistent estimation of dynamic networks with reduced computational burden.

Chern-Simons theory in the 1/N expansion has been conjectured to be equivalent to a topological string theory. This conjecture predicts a remarkable relationship between knot invariants and Gromov-Witten theory. We review some basic aspects of this relationship, as well as the tests of this conjecture performed over th…

2010-01-14abs ↗pdf ↗

Unified analysis for decentralized SGD across various topologies and updates.

problem Analysis of decentralized SGD methods with changing topologies and local updates.
method Unified convergence analysis covering local SGD updates and adaptive network topology.
result Universal convergence rates for smooth problems, interpolating between heterogeneous and iid-data settings.

A3T-GCN improves traffic forecasting by capturing spatial and temporal dependencies.

problem Accurate real-time traffic forecasting in complex road networks.
method Attention Temporal Graph Convolutional Network (A3T-GCN) integrating recurrent units and graph convolutional network.
result Improved prediction accuracy through attention mechanism and global temporal information.

Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.

problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.

Large-scale recurrent networks have drawn increasing attention recently because of their capabilities in modeling a large variety of real-world phenomena and physical mechanisms. This paper studies how to identify all authentic connections and estimate system parameters of a recurrent network, given a sequence of node …

2014-10-05abs ↗pdf ↗

Distance, normals, and double normals for real plane curves with singularities

problem Relation between normals and double normals and critical points of the squared distance function for real algebraic curves with singularities
method Investigate the topological discriminant of the distance function
result The topological discriminant consists of the evolute and distinguished normal lines at algebraic singular points

A compact topological surface S, possibly non-orientable and with non-empty boundary, always admits a Klein surface structure (an atlas whose transition maps are dianalytic). Its complex cover is, by definition, a compact Riemann surface M endowed with an anti-holomorphic involution which determines topologically the o…

2009-12-03abs ↗pdf ↗