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

Trend · papers per month

109217326434 · Jun 202019922001200920182026
48 results for stationary phase approximation

We characterize stationary solutions to McKean-Vlasov equations on the circle.

problem Stationary solutions of McKean-Vlasov equations on the circle.
method Exact equivalence to an infinite-dimensional quadratic system of equations over Fourier coefficients, leading to explicit characterization of stationary states.
result Analytic expressions for the emergence, form, and shape of bifurcations involving multiple Fourier modes, and connections with discontinuous phase transitions.

Efficient GP framework for scalable non-stationary processes.

problem Heavy memory and computational requirements in Gaussian process regression for large data sets.
method Exploits structure in the kernel matrix, uses multiple sets of non-equidistant inducing points, and employs Toeplitz and Kronecker structure for efficient inference.
result Demonstrated scalability on numerical examples and large biomedical datasets.

Improved remainder estimate for eigenvalue asymptotics on manifolds with group actions.

problem Asymptotic distribution of eigenvalues of invariant elliptic operators.
method Refined stationary phase approximation and singular critical sets analysis.
result Asymptotic multiplicity formula for families of irreducible representations.

Using generating functional and replica techniques, respectively, we study the dynamics and statics of a spherical Minority Game (MG), which in contrast with a spherical MG previously presented in J.Phys A: Math. Gen. 36 11159 (2003) displays a phase with broken ergodicity and dependence of the macroscopic stationary s…

2005-08-18abs ↗pdf ↗

New phase harmonic covariance models capture non-Gaussian properties of stationary processes.

problem Capturing non-Gaussian properties of stationary processes using Fourier phase.
method Introduce phase harmonic covariance moments and maximum entropy models conditioned by these moments.
result Maximum entropy models from phase harmonic covariances improve image synthesis of turbulent flows.

Smoothed analysis shows approximate SOSPs are near-optimal for SDPs with random perturbations.

problem Scalability issues in SDPs due to non-convexity of the factorized approach.
method Smoothed analysis of approximate second-order stationary points (SOSPs) under random perturbations.
result Approximate SOSPs are near-optimal for SDPs with k scaling like the square root of the number of constraints.

Complex-valued neural networks improve seismic data analysis by preserving phase information.

problem Low-frequency aliasing in seismic data due to discarded phase information.
method Developed complex-valued deep convolutional networks to leverage phase information in deterministic physical data.
result Complex-valued networks outperform real-valued networks in training and inference from deterministic physical data.

The paper proves optimal smoothness for certain Lagrangian graphs with specific Hölder continuity.

problem Optimal regularity for Hölder continuous Hamiltonian stationary Lagrangian graphs.
method Establishing smoothness conditions based on Hölder exponent and Lagrangian phase properties.
result Smoothness of graphs is achieved when Hölder exponent is strictly greater than 1/3 and Lagrangian phase is supercritical.

Two algorithms maximize DR-submodular functions under convex constraints.

problem Maximizing non-monotone DR-submodular functions under convex constraints.
method Developed two algorithms with provable guarantees: a two-phase algorithm with 1/4 approximation and a Frank-Wolfe variant with 1/e approximation.
result Proved strong relation between stationary points and global optimum for DR-submodular functions.

Enhances DGPs with adaptive RKHS Fourier features for better non-stationary pattern modeling.

problem Capturing complex non-stationary patterns in non-linear dynamical systems.
method Integrates ODE-based RKHS Fourier features into DGPs using convolution operations for adaptive amplitude and phase modulation. Uses a doubly stochastic variational inference framework.
result Improved predictive performance across various regression tasks.

DSSCN improves lifelong learning of non-stationary data streams through adaptive network construction.

problem Lifelong learning of non-stationary data streams with efficient and adaptive models.
method Deep stacked stochastic configuration network (DSSCN) with self-constructing deep stacked network structure and adaptive hidden unit parameters.
result DSSCN outperforms existing data stream algorithms in continual learning of non-stationary data streams.

We study classical spin networks with group SU(2). In the first part, using gaussian integrals, we compute their generating series in the case where the networks are equipped with holonomies; this generalizes Westbury's formula. In the second part, we use an integral formula for the square of the spin network and perfo…

2011-03-29abs ↗pdf ↗

Paper develops a diagnostic test for detecting convergence in SGD with constant step size.

problem Detecting convergence in stochastic gradient descent with constant step size.
method Statistical diagnostic test to detect phase transition in convergence.
result The diagnostic region coincides with the convergence region for a class of loss functions.

Paper tackles non-stationary kernelized bandits with near-optimal algorithm.

problem Minimizing regret in a time-varying reward function.
method Near-optimal algorithm with a novel restarting phased elimination with random permutation (R-PERP).
result Regret upper bound matches the lower bound, making the algorithm near-optimal.

Smooth solutions found for Hamiltonian stationary equations in low dimensions.

problem Finding smooth solutions to Hamiltonian stationary equations in low dimensions.
method Analyzing C1,1C^{1,1} solutions and deriving Ck,αC^{k,α} estimates.
result Smooth solutions exist for Hamiltonian stationary equations in dimensions n4n \leq 4.

In this paper we explore the functional correlation approach to operational risk. We consider networks with heterogeneous a-priori conditional and unconditional failure probability. In the limit of sparse connectivity, self-consistent expressions for the dynamical evolution of order parameters are obtained. Under equil…

2006-09-14abs ↗pdf ↗

New method helps nonconvex optimization algorithms avoid local minima.

problem Nonconvex optimization problems often get stuck in local minima.
method Run-and-Inspect Method: Adds inspection phase to existing algorithms.
result Approximate R-local minimizers are globally optimal under certain conditions.

The method approximates stationary distributions of Markov models by truncating irrelevant states.

problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.

New method reduces variance and bias in approximating indefinite kernels.

problem Approximating non-stationary indefinite kernels with low variance and bias.
method Generalized orthogonal random features (GORF)
result GORF achieves lower variance and approximation error compared to existing methods.

The paper analyzes convergence in SGD with momentum and proposes a diagnostic test.

problem Detecting convergence in stochastic gradient descent with momentum.
method Analyzes the transient and stationary phases of SGD with momentum, constructs a statistical diagnostic test.
result The proposed diagnostic test effectively detects convergence in the stationary phase of SGD with momentum.

Study of asymptotics of meromorphic 3D-index as q approaches 1.

problem Understanding the asymptotic behavior of a meromorphic function related to 3D-index.
method Developed a conjectural asymptotic approximation using stationary phase analysis of a circle-valued angle structure integral.
result Found connections to angle structures and volume optimization.

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

In this article, we give a rough, and so not complete yet, proof of Kashaev's conjecture, that is, the volume conjecture for hyperbolic knots, where the hyperbolicity equations associated to knot diagrams appear as the stationary phase equations for Kashaev's invariants.

2000-09-18abs ↗pdf ↗

This paper tackles the computational complexity of finding approximate stationary points in non-convex optimization.

problem Finding approximate stationary points in non-convex optimization problems.
method PLS-completeness, zero-order algorithms, and gradient queries.
result The query complexity of finding approximate stationary points is Θ(1/ε) for d=2.

Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.

problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density

Data-driven approach learns effective equations for phase field interfaces.

problem Learning accurate equations for phase field interface dynamics.
method Data-driven identification of partial differential equations from phase field data.
result Data-driven equations outperform analytical approximations in certain regimes.

This paper approximates the Gerber-Shiu function using phase-type Levy processes.

problem Measuring the risk of insurance companies through the Gerber-Shiu function.
method Approximate the Gerber-Shiu function by fitting the underlying process with phase-type Levy processes.
result A closed-form approximation of the Gerber-Shiu function is derived.

Researchers discover phase transitions in estimating object ranks from pairwise interactions.

problem Estimating the underlying ranks of objects from pairwise comparisons or collaborations.
method Characterized optimal statistical error rates for various signal-to-noise ratios.
result Phase transitions between optimal error rates of polynomial, exponential, zero, and trivial.

A new algorithm for non-stationary contextual bandits with optimal dynamic regret.

problem Non-stationary contextual bandits with unknown switching frequency and data distribution variation.
method Parameter-free, efficient, and optimal algorithm using replay phases to detect non-stationarity.
result Achieves dynamic regret O(min{ST,Δ13T23})\mathcal{O}(\min\{\sqrt{ST}, Δ^{\frac{1}{3}}T^{\frac{2}{3}}\}).