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

51103154205 · Jun 202019922001200920172026
48 results for Topology Update

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.

We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…

2013-05-20abs ↗pdf ↗

New research shows sparse topologies can lead to faster convergence in distributed optimization.

problem The impact of worker communication topology on convergence speed in distributed optimization.
method Consensus-based distributed optimization methods with local averaging and correction based on local data.
result Sparse topologies can lead to faster convergence in distributed optimization without communication delays.

We use the 2-loop term of the Kontsevich integral to show that there are (many) knots with trivial Alexander polynomial which don't have a Seifert surface whose genus equals the rank of the Seifert form. This is one of the first applications of the Kontsevich integral to intrinsically 3-dimensional questions in topolog…

2002-06-04abs ↗pdf ↗

This is an almost self-contained monograph (containing some new results) on left-orderable groups which mostly rely on dynamical and probabilistic aspects, but also on geometric, combinatorial, analytic, and topological ones. This new version contains many improvements, corrections and updates, many of them suggested b…

2014-08-25abs ↗pdf ↗

Study of profinite quandles with constructions and characterizations.

problem Characterizing and constructing profinite quandles.
method Several constructions and characterizations of profinite quandles from profinite groups and other quandles.
result Characterization of algebraically connected profinite quandles in terms of $\widehat{\Inn(Q)}$.

This note presents the handlebody argument for modifying achiral Lefschetz singularities into broken Lefschetz fibrations, yielding a handlebody proof of the existence of broken Lefschetz fibrations on arbitrary closed smooth oriented 4-manifolds based on the earlier work of Gay and Kirby. Appeared in Geometry and Topo…

2010-09-06abs ↗pdf ↗

This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects of the colored Jones polynomial, emphasizing modularity, stability and effective …

2012-01-16abs ↗pdf ↗

SOM-VQ tokenizes discrete models with semantic structure and navigable topology.

problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.

We give an updated extended survey of results related to the celebrated unsolved generalized R. L. Moore problem. In particular, we address the problem of characterizing codimension one manifold factors, i.e. spaces XX having the property that X×RX \times \mathbb{R} is a topological manifold. A main part of the paper i…

2012-01-18abs ↗pdf ↗

Topological entropy measures the number of distinguishable orbits in a dynamical system, thereby quantifying the complexity of chaotic dynamics. One approach to computing topological entropy in a two-dimensional space is to analyze the collective motion of an ensemble of system trajectories taking into account how traj…

2018-08-30abs ↗pdf ↗

AdaCGP learns dynamic graph topology from time series data, improving over existing methods.

problem Learning dynamic graph topology from time-varying signals, especially in real-time applications.
method AdaCGP is a sparsity-aware adaptive algorithm that recursively estimates the Graph Shift Operator (GSO) through variable splitting.
result AdaCGP outperforms state-of-the-art methods in GSO estimation, achieving improvements exceeding 83%.

We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of O(1/k)O(1/k) with the constant term depending on the numb…

2016-12-06abs ↗pdf ↗

A new method for optimal filtration learning in time-series data analysis.

problem Finding an optimal filtration for analyzing topological properties of discrete data.
method Formulated an optimization problem and proposed an algorithm for solving it.
result Derivation of the exact formula of the gradient of the loss function with respect to filtration parameters.

This survey of some of the more topological aspects of the placement problem for complex curves in complex surfaces was originally published in L'Enseignement Mathematique 29 (1983). The present LaTeXed redaction corrects several typographical errors without, I hope, introducing new ones; some minor emendations and ref…

2001-06-08abs ↗pdf ↗

This paper optimizes portfolios using TDA and financial news sentiment.

problem Effective portfolio diversification through understanding asset similarity.
method Integrates TDA with FinBERT sentiment scores for dynamic rebalancing.
result Outperforms traditional methods in returns and risk-adjusted performance.

Over 50 years of work on group actions on 44-manifolds, from the 1960's to the present, from knotted fixed point sets to Seiberg-Witten invariants, is surveyed. Locally linear actions are emphasized, but differentiable and purely topological actions are also discussed. The presentation is organized around some of the …

2009-07-02abs ↗pdf ↗

CAGNN learns graph embeddings without labels by clustering and refining graph topology.

problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.

Improves decentralized learning by teleporting active nodes for better convergence.

problem Decentralized learning's convergence rate degrades with large node numbers.
method Activates a subset of nodes, fetches parameters from previous active nodes, updates, and performs gossip averaging on a small topology.
result Teleportation completely alleviates convergence rate degradation with proper node activation.

Enhances graph neural networks with structural message-passing for better generalization.

problem Limited representation power and inability to learn basic graph topological properties.
method Proposes a framework that includes a one-hot encoding of nodes and parametrized message and update functions ensuring permutation equivariance.
result Achieves state-of-the-art results on molecular graph regression on the ZINC dataset.

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.

Many applications require sparse neural networks due to space or inference time restrictions. There is a large body of work on training dense networks to yield sparse networks for inference, but this limits the size of the largest trainable sparse model to that of the largest trainable dense model. In this paper we int…

2019-11-25abs ↗pdf ↗

This paper considers the problem of adaptively searching for an unknown target using multiple agents connected through a time-varying network topology. Agents are equipped with sensors capable of fast information processing, and we propose a decentralized collaborative algorithm for controlling their search given noisy…

2015-11-10abs ↗pdf ↗

Optimizes structure topology for ductile and brittle fracture resistance.

problem Minimizing mass while ensuring structural damage and fracture resistance.
method Phase-field approach for modeling fracture, level-set topology optimization.
result Enhanced fracture resistance through two formulations.

A new update rule for deep reinforcement learning reduces learning variance and variance in reference signals.

problem Learning variance and incorrect reference signals in deep reinforcement learning.
method t-soft update method inspired by student-t distribution, which reduces extreme updates and accelerates similar updates.
result The t-soft update method outperforms conventional methods in terms of return and variance in PyBullet robotics simulations.

We investigate self-similar solutions to the inverse mean curvature flow in Euclidean space. In the case of one dimensional planar solitons, we explicitly classify all homothetic solitons and translators. Generalizing Andrews' theorem that circles are the only compact homothetic planar solitons, we apply the Hsiung-Min…

2015-05-01abs ↗pdf ↗

Recently, the technique of local updates is a powerful tool in centralized settings to improve communication efficiency via periodical communication. For decentralized settings, it is still unclear how to efficiently combine local updates and decentralized communication. In this work, we propose an algorithm named as L…

2019-10-21abs ↗pdf ↗

The paper examines how updates to probabilistic models influence behavior based on evidence.

problem Understanding how updates to probabilistic models influence behavior based on evidence.
method Study of KL-regularized soft updates as Bayesian posterior updates within a single probabilistic model.
result Posterior updates determine relative incentives but not absolute rewards, which are ambiguous up to context-specific baselines.

In this paper, we study the randomized distributed coordinate descent algorithm with quantized updates. In the literature, the iteration complexity of the randomized distributed coordinate descent algorithm has been characterized under the assumption that machines can exchange updates with an infinite precision. We con…

2016-09-18abs ↗pdf ↗

Proposes a new method for nonlinear Bayesian updates using ensemble kernel regression.

problem Nonlinear and non-Gaussian Bayesian updates for complex systems.
method Combines Kalman filtering for observed components and kernel density estimation for unobserved components, with subsampling and clustering.
result Reduces estimation errors in highly nonlinear scenarios compared to standard linear updates.

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

In this letter, we generalize the convolutional NMF by taking the ββ-divergence as the contrast function and present the correct multiplicative updates for its factors in closed form. The new updates unify the ββ-NMF and the convolutional NMF. We state why almost all of the existing updates are inexact and approximat…

2018-03-14abs ↗pdf ↗

Recent advances in Quantum Topology assign qq-series to knots in at least three different ways. The qq-series are given by generalized Nahm sums (i.e., special qq-hypergeometric sums) and have unknown modular and asymptotic properties. We give an efficient method to compute those qq-series that come from planar gra…

2013-04-03abs ↗pdf ↗