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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920182026
48 results for note transition

The paper provides examples of geometric transitions in low dimensions.

problem Exploring geometric transitions between different types of structures in low dimensions.
method Explicit examples and computations of transitions from hyperbolic to Euclidean, spherical, and Anti-de Sitter structures.
result Details of elementary computations and techniques are provided to explain geometric transitions.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

problem Quasi-transitive graphs quasi-isometric to planar graphs need to be upgraded to Cayley graphs.
method Upgrading a planar graph to a Cayley graph.
result Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

Forré introduces a new conditional independence notion for mixed variables.

problem Unified framework for random and non-stochastic variables.
method Unified framework of transitional conditional independence and causal calculus for iDMGs.
result Unified framework connects conditional independencies to graphical separation criteria.

We reprove a result concerning certain ruin in the classical problem of the probability of ruin with risky investments and several of it's generalisations. We also provide the combined transition density of the risk and investment processes in the diffusion case.

2005-06-08abs ↗pdf ↗

We prove that (apart from dimension n=4n=4), each Riemannian solenoidal lamination with transitive homeomorphism group and leaves isometric to a symmetric space XX of noncompact type, is homeomorphic to the inverse limit of the system of finite covers of a compact locally-symmetric nn-manifold.

2017-10-16abs ↗pdf ↗

The focus of these lectures is the Gopakumar-Vafa's insight that ``Large N dualities'' (relating gauge theories and closed strings) are realized, in certain cases, by "transition in geometry". In their pivotal 1998 example, the gauge theory is SU(N) Chern-Simons theory on S^3, for large N, and the transition is the "co…

2002-09-04abs ↗pdf ↗

Wide neural networks become linear, but adding bottlenecks makes them bilinear or multilinear.

problem Understanding the transition of neural networks from linearity to higher-order functions.
method Analyzing the behavior of randomly initialized wide neural networks with and without bottleneck layers.
result Bottleneck layers transform the network's function from linear to bilinear or multilinear.

New approach to analyze matrix denoising using gradient flow and fixed point equations.

problem Positive semi-definite matrix denoising in extensive-rank and high-dimensional settings.
method Gradient flow and fixed point equations derived from linear pencil techniques of random matrix theory.
result Continuous phase transitions in the extensive-rank and high-dimensional regime.

Paper tackles instance-dependent label noise by approximating it with part-dependent noise.

problem Learning with instance-dependent label noise is challenging.
method Approximate instance-dependent label noise with part-dependent noise. Use transition matrices for parts to model noise.
result Method outperforms state-of-the-art approaches for instance-dependent label noise.

Double pants decompositions were introduced in our paper "Double pants decompositions of 2-surfaces" (Mosc. Math. J. 11 (2011), no. 2, 231-258, arXiv:1005.0073), together with a flip-twist groupoid acting on these decompositions. It was shown that flip-twist groupoid acts transitively on a certain topological class of …

2015-09-27abs ↗pdf ↗

The abstract discusses the classification of 3D Lie groups with Riemannian metrics.

problem Classifying 3D Lie groups up to quasi-isometries and bi-Lipschitz equivalence.
method Review of existing literature and study of quasi-isometry and bi-Lipschitz equivalence.
result For three-dimensional simply connected groups, quasi-isometry implies isometry with suitable metrics.

A solvmanifold is a compact differentiable manifold M on which a connected solvable Lie group G acts transitively. As the main result, we will see, applying a result of Arapura and Nori on solvable Kaehler groups and some of the author's previous results, that a compact solvmanifold admits a Kaehler structure if and on…

2004-06-11abs ↗pdf ↗

In this note we prove that, for a vector bundle EE over a manifold MM, a Dorfman bracket on TMETM\oplus E^* anchored by prTM\operatorname{pr}_{TM} and with EE a vector bundle over MM, is equivalent to a lift from Γ(TME)Γ(TM\oplus E^*) to linear sections of TETEETE\oplus T^*E\to E, that intertwines the given Dorfman bracket w…

2016-10-19abs ↗pdf ↗

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

Study shows how deep network representations can be transferred between datasets and tasks.

problem Transferability of deep network representations across datasets and tasks.
method Examined layer-wise transferability of representations in deep networks across multiple datasets and tasks.
result Interesting empirical observations on layer-wise transferability of representations.

In this note we consider homogeneous Willmore surfaces in Sn+2S^{n+2}. The main result is that a homogeneous Willmore two-sphere is conformally equivalent to a homogeneous minimal two-sphere in Sn+2S^{n+2}, i.e., either a round two-sphere or one of the Borůvka-Veronese 2-spheres in S2mS^{2m}. This entails a classification o…

2018-05-09abs ↗pdf ↗

ARL-GEN adapts to the smallest model class in nested families for RL with improved regret.

problem Model selection for Reinforcement Learning with nested model families.
method Adaptive Reinforcement Learning (ARL-GEN) with value targeted regression and model selection module.
result ARL-GEN achieves a matching regret to an oracle with knowledge of the true model class.

Paper proposes a model-free algorithm for CMDPs with long-term constraints, achieving optimal regret bounds.

problem Optimizing systems with long-term constraints where transition probabilities are unknown.
method Combines concepts from constrained optimization and Q-learning to propose an algorithm.
result Achieves optimal regret bounds for reward and constraint violation.

We present an explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F(n) embedded in CP3 defined by the equation z0^n + z1^n + z2^n + z3^n = 0 in the standard homogeneous coordinates [z0, z1, z2, z3], where n is any positive integer. Note that F(4) in particular is a K3 surface. Our tessellation…

2008-04-20abs ↗pdf ↗

Develops methods to simulate rare transitions in molecular systems.

problem Rare transitions between metastable states in molecular systems are difficult to study due to limited data.
method Two novel methods: chain-based and midpoint-based approaches.
result Demonstrates effectiveness of methods in both data-rich and data-scarce scenarios.

Overparametrization improves QNN trainability by reducing spurious local minima.

problem Understanding how overparametrization affects the loss landscape of QNNs.
method Rigorous analysis of overparametrization in QNNs with periodic structure.
result Overparametrization corresponds to a computational phase transition improving QNN trainability.

The paper models market crashes as phase transitions, finding dynamic transitions offer better predictions.

problem Understanding and predicting extreme financial events like market crashes.
method Employing phase transition theory, focusing on endogenous crashes, and comparing DPT, CPT, and SPT.
result Dynamic phase transitions provide more accurate predictions of market crashes compared to critical and stochastic models.

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

problem Understanding and characterizing transitive double Lie algebroids.
method Using core diagrams and equivalence of transitive core diagrams with transitive double Lie groupoids.
result Transitive double Lie algebroids are completely determined by their core diagrams.

Dual-T method improves transition matrix estimation in noisy label learning.

problem Large estimation error in noisy class posterior leads to poor transition matrix estimation.
method Introducing an intermediate class to avoid direct estimation of noisy class posterior, factorizing the transition matrix into two easier-to-estimate matrices.
result The dual-T estimator leads to better classification performances.

New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.

problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.