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,695 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for dynamical trichotomy

The thesis shows how automorphisms of hyperbolic groups can be represented by train track maps.

problem Representing automorphisms of hyperbolic groups using train track maps.
method Using graphs of groups and Bestvina-Handel's irreducible train track maps, the thesis constructs relative train track maps.
result Outer automorphisms of finitely-generated word hyperbolic groups satisfy a dynamical trichotomy.

The article classifies curvature functions on compact manifolds with boundaries.

problem Prescribing scalar and mean curvature functions on compact manifolds with boundaries.
method Classification based on the sign of the first eigenvalue of the conformal Laplacian.
result A 'Trichotomy Theorem' for curvature functions is established.

The paper studies mean curvature flow with contact angles in high-dimensional cylinders.

problem Mean curvature flow with prescribed contact angles in a high-dimensional cylinder.
method Derives uniform-in-time gradient bounds and presents a trichotomy result for asymptotic behavior.
result The solution converges to a translating solution with positive speed when a specific condition is met.

This paper continues our study, initiated in [arXiv:1108.3370], of essential state surfaces in link complements that satisfy a mild diagrammatic hypothesis (homogeneously adequate). For hyperbolic links, we show that the geometric type of these surfaces in the Thurston trichotomy is completely determined by a simple gr…

2012-09-25abs ↗pdf ↗

New methods improve neural directed link prediction across all sub-tasks.

problem Directed link prediction requires handling edge directionality and bidirectionality, not just edge existence.
method Proposes three strategies: Multi-Class Framework, Multi-Objective, and Scalarized approaches.
result Improved performance across all three sub-tasks of directed link prediction.

This paper explores conditions for positive scalar curvature on spin^c manifolds.

problem Conditions for the existence of metrics with positive scalar curvature on spin^c manifolds.
method Introduces a new scalar-valued function and uses it to study positivity conditions.
result Equivalence between positivity of the new scalar function and the old twisted scalar curvature.

New algorithm tackles multiclass transductive online learning with unbounded labels.

problem Characterizing optimal mistake bound for unbounded label spaces.
method Introducing new combinatorial dimensions (Level-constrained Littlestone and Branching dimensions) to characterize online learnability.
result Established trichotomy of possible minimax rates for unbounded label spaces: Θ(T)Θ(T), Θ(logT)Θ(\log T), or Θ(1)Θ(1).

A theory for approximating complex concepts with simple decision trees.

problem Approximating complex concepts with simple decision trees.
method Introducing interpretable approximations, studying binary concept approximation by decision trees.
result A trichotomy of cases for approximating a binary concept by decision trees based on a simple class.

The paper introduces a new learning model that explains practical aspects of machine learning.

problem Understanding how quickly a concept class can be learned from examples in practical scenarios.
method Introducing a new learning model that considers fixed data sources and varying number of training examples.
result There are only three possible rates of universal learning: exponential, linear, or arbitrarily slow.

Edge subdivision affects the Perron eigenvalue of tree Ricci matrices.

problem Understanding how edge subdivision impacts the Perron eigenvalue of tree Ricci matrices.
method Compressing branches into scalar feedback functions via Schur complement, reducing the spectral problem to a one-dimensional Chebyshev equation.
result Edge subdivision can decrease, preserve, or increase the Perron eigenvalue of tree Ricci matrices.

The paper solves scalar curvature problems under conformal deformation for Riemannian manifolds.

problem Solving scalar curvature problems under conformal deformation for Riemannian manifolds.
method Pointwise conformal deformation, Yamabe equation with Dirichlet boundary conditions.
result Positive, smooth solutions to the Yamabe equation with Dirichlet boundary conditions.

Study infinite superelliptic curves and their Veech groups, providing geometric and algebraic insights.

problem Characterize Veech groups of infinite superelliptic curves.
method Analyzing geometric properties, differential equations, and group theory.
result Veech groups of infinite superelliptic curves are all matrices permuting branched points.

Study apple tasting feedback in online binary classification, providing new insights into minimax expected mistakes.

problem Online binary classification with partial feedback (apple tasting).
method Combinatorial analysis, Littlestone dimension, Effective width.
result Established a trichotomy of minimax expected mistakes in the realizable setting.

Sharp comparison theorems are derived for all eigenvalues of the (weighted) Laplacian, for various classes of weighted-manifolds (i.e. Riemannian manifolds endowed with a smooth positive density). Examples include Euclidean space endowed with strongly log-concave and log-convex densities, extensions to pp-exponential …

2015-08-03abs ↗pdf ↗

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

This paper studies universal rates of ERM for binary classification under agnostic learning.

problem The challenge of achieving universal rates of ERM for binary classification under agnostic learning.
method The paper explores the agnostic universal rates of ERM for binary classification, revealing three possible rates: ene^{-n}, o(n1/2)o(n^{-1/2}), or arbitrarily slow.
result The paper provides a complete characterization of which concept classes fall into each of the three categories of agnostic universal rates.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

A deterministic apple tasting learner is developed, confirming a conjecture and providing tight bounds for mistake bounds.

problem Determining the learnability of hypothesis classes in binary online classification with apple tasting feedback.
method Developed a deterministic apple tasting learner and proved tight bounds for mistake bounds.
result Deterministic apple tasting is feasible and provides tight bounds for mistake bounds.

Study on hemisphere threshold for Escobar functional on Riemannian manifolds, revealing mass and boundary invariant behaviors.

problem Analyzing the hemisphere threshold for the Escobar functional on compact Riemannian manifolds.
method Near-threshold landscape organization by boundary invariants, exact evaluation of weighted profile moments, Lyapunov-Schmidt correction, and blow-up analysis.
result At threshold, blow-ups concentrate at umbilic points with vanishing mass and gradient, leading to compactness and hemispherical rigidity.

Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.

problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

DOODL learns shared spectral dynamics across related dynamical systems.

problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…

2013-12-04abs ↗pdf ↗

Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.

problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.

dLDS models neural dynamics as sparse combinations of simpler components.

problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…

2015-03-23abs ↗pdf ↗

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.

problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.

NDS learns dynamical models with prior knowledge, improving accuracy and efficiency.

problem Learning accurate dynamical models with limited data and varying dynamics.
method Neural Dynamical Systems (NDS) integrates prior knowledge in ODEs with neural networks to estimate parameters and predict states.
result NDS achieves higher accuracy and uses fewer samples compared to other methods.

New method learns population dynamics from snapshots, outperforming existing models.

problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.

Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.

problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.