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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for gap problem

New methods reduce bias in estimating optimality gaps for risk-averse stochastic programs.

problem Optimality gap estimation bias in risk-averse stochastic programs.
method Two independent samples, each estimating a different component of the optimality gap.
result Our method reduces bias in estimating optimality gaps for risk-averse problems.

Paper proves Simon's third gap conjecture for minimal surfaces in spheres.

problem Investigating the third gap problem in Simon's conjecture for minimal surfaces in unit spheres.
method Developed refined third-order Simons-type integral identities and established new lower bounds for curvature terms.
result Obtained positive gap results for the squared norm of the second fundamental form throughout the interval \(\left[\frac{5}{3},\frac{9}{5} ight]\).

Sharp spectral gap estimates for higher-order operators on hyperbolic spaces.

problem Estimating spectral gaps for higher-order operators on Cartan-Hadamard manifolds.
method Symmetrization-free proofs based on general functional inequalities.
result Solves a sharp asymptotic problem from Cheng and Yang and answers a question from Kristály.

Optimal privacy-preserving algorithm for solving saddle point problems.

problem Solving convex-concave stochastic saddle point problems under differential privacy constraints.
method Recursive regularization technique repurposed for saddle point problems, achieving strong gap rate of O(1/√n + √d/nε).
result Achieves nearly optimal strong gap rate of O(1/√n + √d/nε) with gradient complexity O(min{n^2ε^(1.5)/√d, n^(3/2)}).

Counterexample shows state-constrained optimal control problems can have Young measure gaps.

problem Existence of Young measure gaps in state-constrained optimal control problems.
method Provided a counterexample for smooth controllable systems state-constrained to the unit ball.
result Gap occurs in a regular setting with non-convex Lagrangian density.

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for w…

2005-03-14abs ↗pdf ↗

The article proves a conjecture about the fundamental gap for horoconvex domains in hyperbolic space.

problem Proving a conjecture about the fundamental gap for horoconvex domains in hyperbolic space.
method Establishing conformal log-concavity estimates for the first eigenfunction.
result Proves a conjecture about the fundamental gap for horoconvex domains in hyperbolic space.

This paper studies eigenvalues of the clamped plate problem on a bounded domain in an nn-dimensional Euclidean space. We give an estimate for the gap between Γk+1Γ1\sqrt {Γ_{k+1}-Γ_{1}} and ΓkΓ1\sqrt {Γ_{k}-Γ_{1}}, for any positive integer kk. According to the asymptotic formula of Agmon and Pleijel, we know, the gap betwe…

2016-10-19abs ↗pdf ↗

Proves a fundamental gap lower bound for horoconvex domains in hyperbolic space.

problem Proving a fundamental gap lower bound for horoconvex domains in hyperbolic space.
method Reduces the problem to a radial-height problem, compares Dirichlet forms with angular operators, and uses Green estimates.
result Establishes a polynomial \(D^{-3}\) scale fundamental gap lower bound.

This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programm…

2011-05-04abs ↗pdf ↗

Foundation models improve wage gap decomposition by capturing omitted career history factors.

problem Estimating wage disparities using incomplete career history data.
method Fine-tuning foundation models to mitigate omitted variable bias and estimate wage gaps.
result Foundation models can decompose gender wage gaps more accurately than traditional econometric methods.

Paper tackles fast convergence for non-convex strongly-concave min-max problems.

problem Non-convex strongly-concave min-max problems in deep learning.
method Proximal stage-based method with PL condition for faster convergence.
result Established fast convergence in primal objective gap and duality gap.

Study rigidity of spectral gap on Finsler manifolds with specific curvature bounds.

problem Rigidity of spectral gap on Finsler manifolds with Ricci curvature bound.
method Analysis of spectral gap, splitting phenomena, and needle decomposition.
result Rigidity results for spectral gap, logarithmic Sobolev, and Bakry-Ledoux inequalities.

We consider the problem of estimating from sample paths the absolute spectral gap γγ_* of a reversible, irreducible and aperiodic Markov chain (Xt)tN(X_t)_{t \in \mathbb{N}} over a finite state space ΩΩ. We propose the UCPI{\tt UCPI} (Upper Confidence Power Iteration) algorithm for this problem, a low-complexity algorithm …

2018-06-15abs ↗pdf ↗

Study concavity of solutions to elliptic equations under conformal deformations.

problem Establish concavity estimates for the principle eigenfunction of weighted Schrödinger operators.
method Analyzing the Dirichlet problem for the weighted Schrödinger operator \[-Δu + Vu = λρu\] with conformal connections.
result Partial resolution of Nguyen's conjecture on fundamental gap of horoconvex domains and power convexity estimate for solutions in spherical geometry.

Study analyzes symmetric two-armed Bernoulli bandit problem with zero mean gap.

problem Analyzing symmetric two-armed Bernoulli bandit problem with zero mean gap.
method Associated with a solution of a linear heat equation, compute leading order terms of minmax optimal regret and pseudoregret.
result Explicitly compute leading order terms in three scaling regimes for the gap.

New computational lower bounds for clustering and related problems.

problem Statistical-computational gaps in high-dimensional clustering problems.
method Investigation of low-degree polynomials in latent space models to derive lower bounds.
result New and sharper computational lower bounds for clustering, sparse clustering, and biclustering.

MO-GP models fill gaps in biophysical data with across-domain info transfer.

problem Gap filling of biophysical parameters LAI and fAPAR over rice areas.
method Multi-output Gaussian Processes (MO-GP) based on Linear Model of Coregionalization (LMC).
result MO-GP models successfully predict biophysical variables even in high missing data regimes.

New framework for RL with linear-convex models reduces performance gap.

problem Continuous-time episodic reinforcement learning with unknown coefficients and convex objectives.
method Probabilistic framework and phase-based learning algorithm for optimal exploration-exploitation trade-off.
result Sublinear regrets achieved, matching best possible results in literature.

Estimates scalar curvature without nonnegativity, showing gap phenomenon on manifolds.

problem Estimating scalar curvature without curvature nonnegativity assumption.
method Derive estimates for scalar curvature and mean curvature on manifolds and domains.
result Show that metrics on even dimensional manifolds with nonzero Euler characteristic are ε-gap distance extremal.

We propose two methods for exact Gaussian process (GP) inference and learning on massive image, video, spatial-temporal, or multi-output datasets with missing values (or "gaps") in the observed responses. The first method ignores the gaps using sparse selection matrices and a highly effective low-rank preconditioner is…

2018-08-09abs ↗pdf ↗

This paper studies the problem of adaptively sampling from K distributions (arms) in order to identify the largest gap between any two adjacent means. We call this the MaxGap-bandit problem. This problem arises naturally in approximate ranking, noisy sorting, outlier detection, and top-arm identification in bandits. Th…

2019-06-03abs ↗pdf ↗

Solves approximation problems for zonoids and neural networks, closing gaps in dimensions 2 and 3.

problem Approximating zonoids and shallow neural networks in uniform norm.
method Combines techniques to solve both problems, closing gaps in dimensions 2 and 3.
result Completes the solution for zonoid approximation in all dimensions and improves neural network approximation rates.

This paper bridges the gap between theoretical and practical OPE for bandit problems.

problem Estimating the value of a target policy from samples generated by different policies.
method Categorizing OPE situations based on evaluation policy properties, proposing a meta-algorithm.
result Meta-algorithm successfully bridges the gap between theoretical and practical OPE for bandit problems.

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.

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.

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.

Paper closes the gap in MP-MAB problems with novel adaptive communication and exploration.

problem Closing the gap between decentralized MP-MAB and natural centralized lower bound.
method BEACON: Batched Exploration with Adaptive COmmunicatioN, incorporating ADC and batched exploration.
result Proves logarithmic regret for a generalized MP-MAB problem.

A novel method detects multiple mitosis events and mitigates annotation gaps in phase-contrast microscopy.

problem Detecting multiple mitosis events and handling annotation gaps in closely placed cells.
method Estimating a spatiotemporal likelihood map via 3DCNN to detect multiple mitosis events and mitigate annotation gaps.
result Our method outperformed compared methods in terms of F1-score using a challenging dataset.

The paper explains what affects the generalization gap in visual RL with and without distractors.

problem Understanding what affects the generalization gap in visual reinforcement learning.
method Theoretical analysis and empirical evidence.
result Minimizing representation distance between training and testing environments reduces the generalization gap.

A new neural network model predicts inflation and output gap more accurately.

problem Traditional Phillips curves struggle with unobserved inflation expectations and output gaps.
method Hemisphere Neural Network (HNN) that estimates latent states for inflation and output gap.
result HNN accurately forecasts inflation and identifies a large positive output gap starting from late 2020.

Unified framework for CO problems using RL, providing optimal solutions and convergence guarantees.

problem Combinatorial optimization problems
method Unified framework of Markov decision processes (MDPs) and value-based reinforcement learning (RL) techniques
result RL techniques converge to approximate solutions with a guarantee on optimality gap