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

326597129 · May 202619922001200920172026
48 results for loop corrections

Study loop corrections in random feature models affecting training and test errors.

problem Analyzing loop corrections in random feature models to understand training and test errors.
method Statistical physics and effective field theory approach to study loop corrections.
result Derived loop corrections to training error, test error, and generalization gap.

Researchers provide a simple topological method for Burau representations of loop braid groups.

problem Constructing Burau representations of loop braid groups.
method Simple topological construction of the Burau representations.
result One of the representations is more subtle and topologically natural but not easily combinatorially obvious.

Derives log-corrections in AdS4/CFT3 using supergravity localization.

problem Factorizing log-corrections in AdS4/CFT3.
method Supergravity localization, Atiyah-Singer index theorem, fixed points (NUTs), fixed two-manifolds (Bolts).
result General fixed-point formula for log-corrections in large N expansion.

Construct quaternionic-Kähler metrics from special Kähler manifolds with specific BPS structure variations.

problem Construct quaternionic-Kähler metrics from special Kähler manifolds with mutually local variations of BPS structures.
method Construct quaternionic-Kähler metrics from a conical special Kähler manifold with a certain type of mutually-local variation of BPS structures. Provide global and local explicit formulas for the quaternionic-Kähler metric.
result Construct quaternionic-Kähler metrics that are positive-definite and deform the 1-loop corrected Ferrara-Sabharval metric.

The gradient flow of the Yang-Mills action acts pointwise on closed loops of gauge fields. We construct a topologically nontrivial loop of SU(2) gauge fields on S4 that is locally stable under the flow. The stable loop is written explicitly as a path between two gauge fields equivalent under a topologically nontrivial …

2010-08-06abs ↗pdf ↗

The paper optimizes exceptions in a statistical production system using machine learning.

problem Lack of curated and labeled training data for machine learning in data quality assurance.
method Explainable supervised machine learning to identify and prioritize exceptions.
result Improvement in the quality and efficiency of exceptions generated and authenticated by users.

Program verification offers a framework for ensuring program correctness and therefore systematically eliminating different classes of bugs. Inferring loop invariants is one of the main challenges behind automated verification of real-world programs which often contain many loops. In this paper, we present Continuous L…

2019-09-25abs ↗pdf ↗

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampling inference in programs that explicitly include rejection sampling as part of the user-programmed generative procedure. In this paper we de…

2019-10-20abs ↗pdf ↗

Improved stochastic approximation method reduces residual error.

problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T1/2+o(1)T^{-1/2+o(1)} residual reduction with O(1)O(1) primitive samples.

Unified framework for decentralized bilevel optimization with various heterogeneity-correction strategies.

problem Decentralized bilevel optimization with neighborhood communications and data heterogeneity.
method SPARKLE: Single-loop Primal-dual Algorithm for decentralized bilevel optimization, incorporating various heterogeneity-correction techniques.
result Unified convergence analysis for SPARKLE with state-of-the-art convergence rates compared to existing algorithms.

Polynomial-time algorithm finds short non-orientable loops intersecting graph edges up to 30 times.

problem Finding short non-orientable loops intersecting graph edges efficiently.
method Combining computational biology techniques with recent graph theory results.
result Existence of short canonical non-orientable systems of loops.

Study efficient pricing for barrier options in stochastic-volatility models with leverage correction.

problem Barrier options are sensitive to volatility dynamics, especially leverage, making accurate pricing difficult.
method Developed a class of continuous-path stochastic-clock volatility models and a systematic small-ρ expansion to incorporate leverage.
result Transform-only pricing formulas for barrier derivatives are fast and numerically stable, even for negative leverage.

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

Method improves volatility targeting for index construction.

problem High turnover, leverage spikes, and sensitivity to estimation error in existing volatility-targeting strategies.
method Proportional-control approach for setting index weights that corrects tracking error through feedback.
result The proportional-control approach achieves the target volatility more effectively than open-loop alternatives.

We utilize Wi-Fi communications from smartphones to predict their mobility mode, i.e. walking, biking and driving. Wi-Fi sensors were deployed at four strategic locations in a closed loop on streets in downtown Toronto. Deep neural network (Multilayer Perceptron) along with three decision tree based classifiers (Decisi…

2018-09-16abs ↗pdf ↗

Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typicall…

2016-05-29abs ↗pdf ↗

Quantum field theory connects deep neural networks to criticality.

problem Understanding the criticality and training dynamics of deep neural networks.
method Constructing quantum field theory for deep neural networks, computing corrections to correlation functions.
result Found precise analogy with O(N)O(N) vector model, providing corrections to correlation length.

This work is based on the approach developed by J.~Dorfmeister, F.~Pedit and H.~Wu [GANG and KITCS preprint, Report KITCS94-4-1] to construct maps Φ:DR3Φ:D\rightarrow R^3, DD being the unit disk in CC, whose images are surfaces of constant mean curvature. They start from certain meromorphic one forms, so called meromorp…

1994-12-31abs ↗pdf ↗

Holomorphic supergravity theory simplifies anomaly cancellation in heterotic moduli.

problem Anomaly cancellation in heterotic moduli space.
method Formulated a ten-dimensional version of Kodaira-Spencer gravity, quantized fluctuations, and showed partition function simplification.
result Holomorphic supergravity theory simplifies anomaly cancellation and relates to type I Kodaira-Spencer theory.

Deep neural network solves portfolio optimization with MGARCH and small transaction costs.

problem Optimizing portfolios with MGARCH and small transaction costs.
method Fixed-point RL algorithm using neural networks.
result NN algorithm shows positive testing performance.

Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop homotopy class, and of the first and second homologies, defined by the lower central…

2019-08-14abs ↗pdf ↗

We produce skew loops -- loops having no pair of parallel tangent lines -- homotopic to any loop in a flat torus or other quotient of R^n. The interesting case here is n=3. More subtly for any n, we characterize the homotopy classes that will contain a skew loop having a specified loop in the unit sphere as tangent ind…

2007-01-31abs ↗pdf ↗

Rational loops played a central role in Uhlenbeck's construction of harmonic maps into U(n) (chiral model in physics), and they are generated by simple elements with one pole and one zero constructed from Hermitian projections. It has been believed for long time that nilpotent loops should be added to generate rational…

2018-12-03abs ↗pdf ↗

We discuss certain recent mathematical advances, mainly due to Perelman, in the theory of Ricci flows and their relevance for renormalization group (RG) flows. We consider nonlinear sigma models with closed target manifolds supporting a Riemannian metric, dilaton, and 2-form B-field. By generalizing recent mathematical…

2005-10-27abs ↗pdf ↗

Using the relations between the theory of differentiable Bol loops and the theory of affine symmetric spaces we classify all connected differentiable Bol loops having an at most 99-dimensional semi-simple Lie group as the group topologically generated by their left translations. We show that all these Bol loops are is…

2015-07-01abs ↗pdf ↗

A skew loop is a closed curve without parallel tangent lines. We prove: The only complete surfaces in euclidean 3-space with a point of positive curvature and no skew loops are the quadrics. In particular, ellipsoids are the only closed surfaces without skew loops. We also prove results about skew loops on cylinders an…

2002-05-21abs ↗pdf ↗

Study shows looping a 6-manifold over a 4-manifold results in a product of loops on spheres.

problem Understanding the homotopy properties of 6-manifolds over 4-manifolds.
method Analyzes the homotopy equivalence and rational homotopy of the total space of a sphere bundle over a 4-manifold.
result Looping a 6-manifold over a 4-manifold is homotopy equivalent to a product of loops on spheres.

New theory defines invariants for framed 3-manifolds using trivalent graphs with self-loops.

problem Defining invariants for framed 3-manifolds with semi-simple Lie groups.
method Constructing graph complexes and cocycles, including self-loops, to define invariants.
result Higher-loop invariants can be defined by graph cocycles with or without self-loops.

New definition of twisted 1-loop invariant using Ptolemy coordinates.

problem Defining and proving properties of twisted 1-loop invariants.
method Alternative definition via Jacobian of Ptolemy coordinates.
result Twisted 1-loop invariant equals adjoint twisted Alexander polynomial for hyperbolic once-punctured torus bundles.