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

Trend · papers per month

14294357 · Jun 202019922001200920172026
48 results for Warm-Up Phase

Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.

problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.

DP-SGD can update fewer coordinates while maintaining privacy.

problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).

Warm-up improves training by adapting learning rate based on curvature.

problem Improving training efficiency in deep learning models.
method Introducing a curvature condition to explain warm-up, and showing empirically that it leads to faster convergence.
result Adapting learning rate based on curvature condition naturally induces warm-up-like schedule, leading to faster convergence.

The paper shows how warming up the learning rate improves deep learning performance.

problem Improving deep learning performance through better handling of larger learning rates.
method Systematic experiments with SGD and Adam showing the benefits of warmup and different regimes of operation.
result Properly choosing ηextinitη_{ ext{init}} can eliminate the need for warmup and improve performance.

The Transformer is widely used in natural language processing tasks. To train a Transformer however, one usually needs a carefully designed learning rate warm-up stage, which is shown to be crucial to the final performance but will slow down the optimization and bring more hyper-parameter tunings. In this paper, we fir…

2020-02-12abs ↗pdf ↗

Optimizes neural network training by dynamically updating Tucker decomposition ranks.

problem Redundant parameters in neural network architectures.
method Geometry-aware training of factorized layers in tensor Tucker format.
result Optimal locally approximating the original dynamics without initial rank knowledge.

Study on multi-head softmax attention dynamics for in-context learning.

problem Understanding and optimizing multi-head softmax attention models for multi-task linear regression.
method Gradient flow analysis and spectral mapping technique.
result Gradient flow converges to optimal multi-head softmax attention model, with task allocation emerging during training.

A novel framework IMBoost improves outlier detection by leveraging the inlier memorization effect.

problem Challenges in unsupervised outlier detection, especially when inliers and outliers are not well-separated or form dense clusters.
method IMBoost framework that incorporates active learning to selectively acquire informative labels and explicitly reinforce the inlier memorization effect.
result IMBoost significantly outperforms state-of-the-art active outlier detection methods and requires less computational cost.

VBS improves sampling efficiency in cosmological data analysis.

problem High dimensionality of cosmological parameter space makes sampling computationally challenging.
method Developed a hybrid scheme combining variational self-boosted sampling with Hamiltonian Monte Carlo.
result VBS generates better quality samples and reduces auto-correlation length by a factor of 10-50.

Paper optimizes MVE network convergence and regularization.

problem Optimizing Mean Variance Estimation networks for better performance.
method Presented two key insights: warm-up period for mean optimization and separate regularization of mean and variance.
result Warm-up period and separate regularization improve MVE network performance.

The large kk asymptotics (perturbation series) for integrals of the form FμeikS\int_{\cal F}μe^{i k S}, where μμ is a smooth top form and SS is a smooth function on a manifold F{\cal F}, both of which are invariant under the action of a symmetry group G{\cal G}, may be computed using the stationary phase approximation…

1995-11-27abs ↗pdf ↗

AdaScale SGD adapts learning rates for large-batch training efficiently.

problem Adapting learning rates for large-batch training to balance speed-ups and model quality.
method Adaptive learning rate adaptation based on gradient variance.
result AdaScale achieves reliable speed-ups for a wide range of batch sizes without degrading model quality.

More and more companies have deployed machine learning (ML) clusters, where deep learning (DL) models are trained for providing various AI-driven services. Efficient resource scheduling is essential for maximal utilization of expensive DL clusters. Existing cluster schedulers either are agnostic to ML workload characte…

2019-09-13abs ↗pdf ↗

We provide a differential cocycle model for elliptic cohomology with complex coefficients and use analytic methods to construct a cocycle representative for the Witten class in this language. Our motivation stems from the conjectural connection between 2-dimensional field theories and elliptic cohomology originally due…

2013-11-26abs ↗pdf ↗

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.

We prove that in CAT(0) spaces a quasi-geodesic is Morse if and only if it is contracting. Specifically, in our main theorem we prove that for γγ a quasi-geodesic in a CAT(0) space X, the following four statements are equivalent: (i) γγ is Morse, (ii) γγ is (b,c)--contracting, (iii), γγ is strongly contracting, and…

2011-12-19abs ↗pdf ↗

This work analyzes the statistical properties of adaptive gradient methods.

problem Lack of understanding of the statistical properties of adaptive gradient methods.
method Theoretical analyses and experiments on the variance of update magnitudes.
result The variance of update magnitudes is an increasing and bounded function of time, not diverging.

We propose a statistical adaptive procedure called SALSA for automatically scheduling the learning rate (step size) in stochastic gradient methods. SALSA first uses a smoothed stochastic line-search procedure to gradually increase the learning rate, then automatically switches to a statistical method to decrease the le…

2020-02-25abs ↗pdf ↗

Variational Autoencoders are powerful models for unsupervised learning. However deep models with several layers of dependent stochastic variables are difficult to train which limits the improvements obtained using these highly expressive models. We propose a new inference model, the Ladder Variational Autoencoder, that…

2016-02-06abs ↗pdf ↗

Solves Dirichlet problem for Lagrangian phase equation with critical and supercritical phase.

problem Solving Dirichlet problem for Lagrangian phase equation with critical and supercritical phase.
method Uses interior C2C^2 estimate.
result Result is sharp, showing existence of singular solutions in subcritical phase.

New method tightens federated probe-logit distillation rates under varying bandwidths.

problem Estimating conditional distributions in federated learning with heterogeneous bandwidth constraints.
method Developed a new federated probe-logit distillation (FPLD) method with optimal allocation for varying bandwidths.
result Achieved matching lower and upper bounds for the minimax rate under heterogeneous bandwidths.

A major issue in harmonic analysis is to capture the phase dependence of frequency representations, which carries important signal properties. It seems that convolutional neural networks have found a way. Over time-series and images, convolutional networks often learn a first layer of filters which are well localized i…

2018-10-29abs ↗pdf ↗

New algorithms handle phase retrieval with rank d measurements, revealing phase transitions.

problem Phase retrieval with rank d measurements.
method Random duality theory (RDT) and descending phase retrieval algorithms (dPR).
result Minimal sample complexity ratio for dPR's success exhibits phase transitions.

Machine learning predicts phase behavior in active matter suspensions.

problem Predicting phase behavior in active matter systems using machine learning.
method Used deep learning techniques, including fully connected networks and graph neural networks, to predict motility-induced phase separation (MIPS) in ABP suspensions.
result Strong agreement between machine learning predictions and MIPS binodal from simulations, suggesting machine learning as an effective method for phase behavior determination.

The big phase space, the geometric setting for the study of quantum cohomology with gravitational descendents, is a complex manifold and consists of an infinite number of copies of the small phase space. The aim of this paper is to define a Hermitian geometry on the big phase space. Using the approach of Dijkgraaf and …

2012-11-23abs ↗pdf ↗

Diffusion maps help learn complex quantum phase transitions from data.

problem Learning quantum phase transitions from experimental data is challenging.
method Diffusion maps for nonlinear dimensionality reduction and spectral clustering.
result Diffusion maps can learn complex phase transitions unsupervised.

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.

Unsupervised learning is a discipline of machine learning which aims at discovering patterns in big data sets or classifying the data into several categories without being trained explicitly. We show that unsupervised learning techniques can be readily used to identify phases and phases transitions of many body systems…

2016-06-01abs ↗pdf ↗

Common models for two-phase lipid bilayer membranes are based on an energy that consists of an elastic term for each lipid phase and a line energy at interfaces. Although such an energy controls only the length of interfaces, the membrane surface is usually assumed to be at least C1C^1 across phase boundaries. We consi…

2016-03-01abs ↗pdf ↗

Novel M-theory approach classifies topological phases of matter.

problem Classifying and understanding topological phases of matter.
method Establishing a correspondence between (2+1)d topological field theories and non-hyperbolic 3-manifolds, identifying topological phases from internal wrapped 3-manifolds.
result Paves a new route toward the classification of topological phases of matter, including fermionic and non-unitary phases.

Study oscillatory integrals with degenerate singular points in multivariable phase functions.

problem Analyzing oscillatory integrals with degenerate singular points in phase functions.
method Using asymptotic expansions and results from one variable, the study examines multivariable phase functions.
result Asymptotic expansions of oscillatory integrals for multivariable phase functions with degenerate singular points.

The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…

2001-10-10abs ↗pdf ↗

The classification of phase transitions is a central and challenging task in condensed matter physics. Typically, it relies on the identification of order parameters and the analysis of singularities in the free energy and its derivatives. Here, we propose an alternative framework to identify quantum phase transitions,…

2019-04-02abs ↗pdf ↗

The Allen-Cahn system on manifolds yields multiple phase distributions.

problem Finding the number of solutions to the Allen-Cahn system on manifolds.
method Volume-fixing variations approach to classify isoperimetric clusters.
result The number of solutions is bounded by topological invariants for parallelizable manifolds.