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

66132197263 · Jun 202019922001200920172026
48 results for small gap

Study best arm identification with contextual info, achieving optimal misidentification probability.

problem Identify the best treatment arm with minimal misidentification probability in a small gap scenario.
method Developed RS-AIPW strategy that matches lower bound of misidentification probability in the small-gap regime.
result RS-AIPW strategy is asymptotically optimal for best arm identification.

The study finds arbitrarily small spectral gaps for random hyperbolic surfaces with many cusps.

problem Understanding spectral gaps of random hyperbolic surfaces with many cusps.
method Analysis of moduli spaces of hyperbolic surfaces with Weil-Petersson metric.
result Arbitrarily small spectral gaps are observed as the number of cusps grows slower than the genus.

New theorem shows curvature concentration depends linearly on volume ratio.

problem Gap theorem for nonnegative Ricci curvature manifolds with small curvature concentration.
method Exhibited Ricci flow solution with faster than 1/t curvature decay.
result Curvature concentration depends linearly on asymptotic volume ratio.

Factorial moments are convenient tools in particle physics to characterize the multiplicity distributions when phase-space resolution (ΔΔ) becomes small. They include all correlations within the system of particles and represent integral characteristics of any correlation between these particles. In this letter, we sh…

2011-08-30abs ↗pdf ↗

Optimal strategy found for identifying best arm in bandits with small gap.

problem Best arm identification in two-armed bandits with a fixed budget and small gap.
method Neyman allocation rule augmented with inverse probability weighting.
result Proposed strategy is asymptotically optimal when gap is small.

Negative curvature restricts the gap between the first and second eigenvalues of convex domains.

problem The fundamental gap of convex domains is limited by negative curvature.
method Adapted from Bourni et. al. (2022) for Riemannian manifolds with negative sectional curvature.
result The product of the fundamental gap and the square of the diameter can be arbitrarily small in domains with negative curvature.

Random feature model shows slow self-correction of generalization gap.

problem Slow deterioration of generalization error in random feature model.
method Examined the dynamic behavior of gradient descent in the model's resonance regime.
result Gradient descent exhibits a self-correction mechanism, reducing generalization gap over time.

Paper tackles small eigen-gap estimation and inference for noisy symmetric matrices.

problem Estimating eigenvectors with small eigen-gap and fine-grained statistical reasoning.
method Eigen-decomposition of asymmetric data matrix, distribution-free procedures, adaptive to heteroscedastic noise.
result Minimax optimal under Gaussian noise, confidence intervals for eigenvalues, small eigen-gap handling.

Paper addresses eigenvector perturbation in small eigen-gap scenarios.

problem Fine-grained behavior of eigenvectors in the presence of small eigen-gaps.
method Develops de-biased estimators for linear functions of an unknown eigenvector.
result Achieves minimax lower bounds for a family of scenarios, even with small eigen-gaps.

We present a separation property for the gaps in the length spectrum of a compact Riemannian manifold with negative curvature. In arbitrary small neighborhoods of the metric for some suitable topology, we show that there are negatively curved metrics with a length spectrum exponentially separated from below. This prope…

2018-06-18abs ↗pdf ↗

New algorithm identifies good arms with fewer samples when thresholds are close.

problem Good arm identification in bandit problems with small threshold gaps.
method Proposes lil'HDoC algorithm to improve GAI under small threshold gaps.
result Sample complexity of first λ output arm is nearly identical to HDoC algorithm when thresholds are close.

Geodesic spheres in certain symmetric spaces are quantitatively stable under small perturbations.

problem Stability of geodesic spheres in symmetric spaces under perturbations.
method Quantitative stability analysis using spectral gap of the Laplacian on geodesic spheres.
result Geodesic spheres are uniformly stable with respect to small C1C^1-volume preserving perturbations.

We study the spectrum of the Finsler--Laplace operator for regular Hilbert geometries, defined by convex sets with C2C^2 boundaries. We show that for an nn-dimensional geometry, the spectral gap is bounded above by (n1)2/4(n-1)^2/4, which we prove to be the infimum of the essential spectrum. We also construct examples of c…

2012-11-27abs ↗pdf ↗

Study on AI-driven modeling for high burnup accident-tolerant fuels in SMRs.

problem Design and optimization of high burnup accident-tolerant fuels for SMRs.
method Artificial intelligence and multi-scale modeling (neutronics, thermal hydraulics, fuel performance).
result Demonstrated the effectiveness of AI in modeling and optimizing SMR fuels.

UCB algorithm's arm-sampling behavior is revealed, leading to new insights and proofs.

problem Optimizing multi-armed bandit algorithms for worst-case scenarios.
method Analysis of UCB algorithm's arm-sampling behavior and process-level characterization.
result UCB's arm-sampling rates are asymptotically deterministic, regardless of problem complexity.

Given a collection of entities (or nodes) in a network and our intermittent observations of activities from each entity, an important problem is to learn the hidden edges depicting directional relationships among these entities. Here, we study causal relationships (excitations) that are realized by a multivariate Hawke…

2016-08-03abs ↗pdf ↗

Study small perturbations on low energy Laplace eigenfunctions.

problem Understanding small changes in low energy Laplace eigenfunctions.
method Investigates nodal geometry and topology, focusing on low frequency regimes and small perturbations.
result Highlight interesting aspects of spectral theory and nodal phenomena tied to ground state/low energy eigenfunctions.

The study provides energy estimates for Willmore surfaces and derives a gap statement.

problem Analyzing the tracefree curvature of Willmore surfaces.
method Proves ε-regularity result for tracefree curvature with bounded second fundamental form.
result Derives a gap statement for surfaces of the specified type.

Framework explains deep learning generalization by comparing real and ideal worlds.

problem Understanding why deep models generalize well in practice.
method Integrates real-world empirical loss with ideal population loss to decompose test error.
result The gap between real and ideal worlds is small in deep learning, suggesting robust optimization leads to good generalization.

Unified framework for adaptive learning systems using consolidation and expansion operations.

problem Managing the balance between consolidating known knowledge and expanding into new evidence in adaptive learning systems.
method Introduces Consolidation-Expansion Operator Mechanics (OpMech) with the order-gap metric to control the balance.
result The order-gap signal provides real-time control and termination guarantees for adaptive learning systems.

Sharp stability of Alexandrov's theorem for C1C^1 domains in the small-excess regime

problem Stability of Alexandrov's theorem for C1C^1 domains in the small-excess regime
method Combines a BVBV version of Fuglede's spectral-gap argument, a star-shaped rearrangement for sets of finite perimeter, quantitative estimates for the part of the boundary contained in the tentacles, and a polyhedral approximation argument for the non-graphical region
result Sharp stability estimate in a genuinely non-parametric regime

In this short note, using Günther's volume comparison theorem and Yokota's gap theorem on complete shrinking gradient Ricci solitons, we prove that for any complete shrinking gradient Ricci soliton (Mn,g,f)(M^{n},g,f) with sectional curvature K(g)<AK(g)<A and Volf(M)v{\rm Vol}_{f}(M)\geq v for some uniform constant A,vA,v, there exists…

2019-06-02abs ↗pdf ↗

New bound limits generalization gap for large models, independent of model complexity.

problem Understanding generalization gap in large-scale machine learning models.
method Established a model-independent upper bound for generalization gap using Rényi entropy.
result Generalization gap can be maintained with arbitrarily large models if data entropy is sufficient.

Paper establishes a universal growth rate for smooth surrogate losses in classification.

problem Analyzing growth rates of consistency bounds for various surrogate losses.
method Proves square-root growth rate for smooth margin-based losses; extends to multi-class classification.
result Demonstrates a universal square-root growth rate for smooth comp-sum and constrained losses.

Detection of dense cycles in graphs reveals a gap between easy detection and hard recovery.

problem Detecting and recovering dense cycles in Erdős-Rényi graphs.
method Characterization of computational thresholds for detection and recovery using low-degree polynomial algorithms.
result A gap exists between the detection and recovery thresholds for certain parameter regimes.

Proves product metrics are Yamabe metrics under small flat torus conditions.

problem Yamabe metrics on product spaces with small flat tori.
method Extends earlier results to Type~I and Type~II Yamabe constants, QQ-curvature problems, and isoperimetric-ratio type problems.
result Product metrics are Yamabe metrics for sufficiently small flat tori.

Improved online Q-learning for MDPs with concentration bounds.

problem Online Q-learning in infinite-horizon discounted MDPs with sublinear regret for large gaps.
method Smoothed εnε_n-Greedy exploration scheme combining εnε_n-greedy and Boltzmann exploration, analyzed using concentration bounds for contractive Markovian stochastic approximation.
result Near-ildeO(N9/10) ilde{O}(N^{9/10}) regret bound for Smoothed εnε_n-Greedy exploration scheme.

Sparse attention model reduces long-context inference time with exponential accuracy guarantees.

problem Efficiently processing long-context queries in large language models.
method Formalizes attention as a projection onto key vectors, analyzes entropic relaxation, and introduces Vashista Sparse Attention.
result Sparse attention concentrates on a constant-size active face, leading to exponential decay of inactive tokens' mass and linear scaling of active face error.