We relate generalized Lebesgue decompositions of measures in terms of curve fragments (Alberti representations) and Weaver derivations. This correspondence leads to a geometric characterization of the local norm on the Weaver cotangent bundle of a metric measure space : the local norm of a form sees how fas…
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
48 results for “Local-Norm Lower-Bounds”
Optimizes exp-concave losses with a new risk bound.
problem Optimizing exp-concave losses with stochastic convex optimization.
method Empirical Risk Minimization with a unified geometric assumption and local norms.
result Provides an excess risk bound.
New algorithm bounds MAB regret for unknown scale and magnitude of losses.
problem Adversarial Multi Armed Bandits with unknown scale and magnitude of losses.
method Design a bandit Follow The Regularized Leader (FTRL) algorithm with adaptive learning rate.
result First MAB bounds that adapt to and norms of losses.
Local norms of Fourier multipliers bounded on discrete subgroups of Lie groups.
problem Bounding norms of Fourier multipliers on discrete subgroups of Lie groups.
method Developed tools to find explicit bounds on , reducing the problem to representations of semisimple and radical parts of Lie algebras.
result Explicit bounds on for unimodular connected solvable Lie groups, showing .
New bounds for online portfolio selection without smoothness assumptions.
problem Online portfolio selection with non-Lipschitz, non-smooth losses.
method Data-dependent bounds using novel smoothness characterizations and FTRL with self-concordant regularizers.
result Achieves logarithmic regrets when data is 'easy' and sublinear worst-case regrets.
New framework for PMD convergence in non-tabular environments.
problem Applying PMD to general policy classes with weak closure conditions.
method Develops a theoretical framework with a novel smoothness notion.
result Obtains upper bounds on convergence rate for non-tabular environments.
New method for RLHF reduces costs by integrating new data in one pass.
problem Continuous integration and re-optimization of models in RLHF leads to high computational and storage costs.
method Proposes a one-pass reward modeling method using online mirror descent with a tailored local norm.
result Achieves constant-time updates per iteration, enhancing both statistical and computational efficiency.
Along the line of the Yang Conjecture, we give a new estimate on the lower bound of the first non-zero eigenvalue of a closed Riemannian manifold with negative lower bound of Ricci curvature in terms of the in-diameter and the lower bound of Ricci curvature.
There has been renewed recent interest in developing effective lower bounds for Dynamic Time Warping (DTW) distance between time series. These have many applications in time series indexing, clustering, forecasting, regression and classification. One of the key time series classification algorithms, the nearest neighbo…
Lower bounds on ribbon distance using Bar-Natan and α-Homology.
problem Calculating the minimum number of ribbon operations to unknot a knot.
method Bar-Natan Homology and α-Homology approaches.
result Lower bounds on ribbon distance via both Bar-Natan and α-Homology.
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem…
Lower bound found for Kähler manifold eigenvalues.
problem Finding bounds for eigenvalues on Kähler manifolds.
method Comparison results of Li and Wang applied to Kähler manifolds.
result Explicit lower bound of the first eigenvalue determined.
We prove non-asymptotic lower bounds on the expectation of the maximum of independent Gaussian variables and the expectation of the maximum of independent symmetric random walks. Both lower bounds recover the optimal leading constant in the limit. A simple application of the lower bound for random walks is an (…
The paper establishes bounds on scalar curvature on asymptotically flat manifolds.
problem Establishing scalar curvature bounds on asymptotically flat manifolds.
method Using Ricci-DeTurck flow and distributional scalar curvature, the paper derives bounds on scalar curvature.
result The scalar curvature lower bound under Ricci-DeTurck flow depends on the scalar curvature lower bound in the β-weak sense and time.
New algorithms for private GLM estimation with minimax lower bounds.
problem Privacy in generalized linear models.
method Differentially private algorithms using projected gradient descent.
result Nearly rate-optimal performance with privacy-constrained minimax lower bounds.
Lower bounds for eigenvalues on Bakry-Emery manifolds proven.
problem Eigenvalue estimates on Bakry-Emery manifolds.
method Generalised maximum principle and heat kernel estimates.
result Lower bounds for all eigenvalues proven.
Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.
problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.
Lower bound found for volatility swap in SABR model.
problem Finding a lower bound for volatility swap in SABR model.
method Short time to maturity limit analysis of conditionally lognormal SABR model.
result Zero vanna implied volatility is a lower bound for volatility swap strike.
Study sets lower bounds for Kähler manifolds' Laplacian eigenvalues.
problem Finding bounds for eigenvalues on Kähler manifolds.
method Establishes lower bounds using geometric data like dimension, diameter, and curvature.
result Proves bounds for Laplacian eigenvalues on Kähler manifolds.
Study eigenvalues of p-Laplacian on Kähler manifolds, proving lower bounds.
problem Eigenvalue problem for the p-Laplacian on Kähler manifolds.
method Lower bounds derived using dimension, diameter, curvature bounds.
result Sharp lower bounds for the first Dirichlet eigenvalue of the p-Laplacian.
Unified framework for lower bounds in interactive decision making.
problem Challenges in interactive decision making, especially bandits and reinforcement learning.
method Interactive Fano method and Fractional Covering Number.
result Unified characterization of learnability for stochastic bandit problems and tight lower bounds for interactive decision making.
The standard interpretation of importance-weighted autoencoders is that they maximize a tighter lower bound on the marginal likelihood than the standard evidence lower bound. We give an alternate interpretation of this procedure: that it optimizes the standard variational lower bound, but using a more complex distribut…
New study on regret lower bounds for multi-agent multi-armed bandit problems.
problem Understanding the limits of performance in multi-agent multi-armed bandit problems.
method Comprehensive study on different settings, establishing tight lower bounds.
result First comprehensive study on regret lower bounds across various settings.
The paper improves regret lower bounds for communicating MDPs.
problem Regret lower bounds for communicating MDPs.
method Lower bound proof and optimization problem formulation.
result Regret lower bound becomes significantly more complex in communicating MDPs.
We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants, and give a lower bound on the number of curves in this case. The lower bound for …
Paper proves first non-trivial PTF testing lower bounds for NGCA.
problem Proving lower bounds against PTF tests is challenging.
method Developed tools to prove PTF testing lower bounds for NGCA.
result First non-trivial PTF testing lower bounds for NGCA.
Paper establishes new lower bounds for MDPs with changing transition kernels.
problem Minimizing sample complexity and regret in non-stationary MDPs.
method Developed novel lower bounds and constructed hard MDPs.
result Proved sample complexity lower bound.
New self-imitation learning method improves performance in continuous control tasks.
problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.
Lower bounds set for infinite-precision transformers.
problem Understanding limitations of infinite-precision transformers.
method Used VC dimension technique to prove lower bounds.
result First lower bounds for two tasks: function composition and SUM.
Lower bounds for geodesically convex optimization show curvature negatively impacts complexity.
problem Understanding the impact of curvature on the query complexity of geodesically convex optimization.
method Building on recent lower bounds, the study proposes and proves new lower bounds for various settings of geodesically convex optimization.
result Negative curvature is detrimental to the complexity of geodesically convex optimization.
Sharp lower bound on fold singularities self-intersections.
problem Finding a lower bound on the number of self-intersections of fold singularities.
method Established a sharp lower bound on the number of self-intersections of the boundary of an immersed surface, then applied this to fold singularities.
result Sharp lower bound on the number of self-intersections of fold singularities.
Lower bounds for the first Laplacian eigenvalue of geodesic balls of spherically symmetric manifoldsmath.DG
We obtain lower bounds for the first Laplacian eigenvalues of geodesic balls of spherically symmetric manifolds. These lower bounds are only dependent on the metric coefficients.
Paper establishes lower bounds for Gaussian process bandit optimization under various perturbation models.
problem Lower bounds for Gaussian process bandit optimization in noisy and robust settings.
method Novel proof techniques for standard and robust settings, including deterministic strategies.
result Demonstrates inevitable joint dependence of cumulative regret on corruption level and time horizon in robust settings.
Lower bounds found for nonconvex-strongly-concave min-max optimization problems.
problem Finding stationary points in nonconvex-strongly-concave min-max optimization.
method Provided lower bounds for first-order oracle complexity.
result Lower bounds of Ω(√κε⁻²) for deterministic oracles and Ω(√κε⁻² + κ¹/₃ε⁻⁴) for stochastic oracles.
New lower bounds for combinatorial multi-armed bandits for general reward functions.
problem Maximizing reward in sequential decisions with sets of arms.
method Proved tight regret lower bounds for all smooth reward functions under mild assumptions.
result Lower bounds are tight up to log-factors for monotone reward functions.
Paper tightens lower bounds on decentralized training complexity.
problem Understanding and optimizing iteration complexity in decentralized training.
method Proved a tight lower bound on iteration complexity and proposed DeTAG algorithm.
result DeTAG achieves the theoretical lower bound with only a logarithmic gap.
Lower bound on stretch factor for periodic maps.
problem Finding a lower bound on stretch factors for periodic maps.
method Using core characteristic of end-periodic homeomorphisms, we derive a lower bound on the Handel-Miller stretch factor.
result The derived bound is sharp and measures topological complexity.
Proves equivalence of two types of Ricci curvature bounds.
problem Equivalence of distributional and synthetic Ricci curvature bounds.
method Analyzes weighted Riemannian manifolds with specific smoothness conditions.
result Proves equivalence of Ricci curvature bounds under given conditions.
Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.
problem Proving lower bounds for online multicalibration in relation to marginal calibration.
method Information-theoretic approach, constructing group families from orthonormal bases.
result Establishes tight lower bounds for online multicalibration, matching upper bounds up to logarithmic factors.
The paper sets information-theoretic lower bounds for neural networks' parameter recovery and excess risk.
problem Establishing sample complexity lower bounds for neural network parameters and excess risk.
method Using information-theoretic tools, the paper proves lower bounds by constructing a generative network.
result Proves information-theoretic lower bounds for exact parameter recovery and positive excess risk.
The paper sets lower bounds for sampling non-log-concave distributions using Fisher information.
problem Understanding the complexity of sampling non-log-concave distributions.
method Proves two lower bounds using Fisher information in the context of sampling.
result Lower bounds on the complexity of sampling non-log-concave distributions, ruling out high-accuracy algorithms.
Lower bound on stable 4-genus of knots using Casson-Gordon signatures.
problem Finding a lower bound on the stable 4-genus of knots.
method Using Casson-Gordon τ-signatures to compute the lower bound.
result A twist knot is torsion in the knot concordance group if and only if it has vanishing stable 4-genus.
Paper presents a reduction-based framework for conservative bandits and RL with improved lower and upper bounds.
problem Conservative bandits and reinforcement learning problems.
method Reduction technique to calculate necessary and sufficient budget from baseline policy.
result Improved lower and upper bounds for various conservative settings.
We give an estimate on the lower bound of the first non-zero eigenvalue of the Laplacian for a closed Riemannian manifold with positive Ricci curvature in terms of the in-diameter and the lower bound of the Ricci curvature.
Sharp lower bound for Hodge Laplacian on Kähler hyperbolic manifolds.
problem Finding a sharp lower bound for the spectrum of the Hodge Laplacian.
method Explicitly expressed in terms of the supremum norm of the 1-form.
result Explicit spectral lower bounds for bounded symmetric domains.
Paper proves a new lower bound on calibration error for binary prediction.
problem Proving a strong lower bound on calibration error for binary prediction.
method Developed two new techniques: early stopping and sidestepping.
result Proves an lower bound on calibration error.
Improved upper bound for online calibrated forecasting of binary sequences.
problem Online calibrated forecasting of binary sequences.
method Introducing a variant of Qiao & Valiant's sign preservation game called sign preservation with reuse (SPR) and proving its equivalence to calibrated forecasting.
result Improved upper bound of for calibrated forecasting, improving the bound of Foster & Vohra.
We prove lower bounds for the Hausdorff measure of nodal sets of eigenfunctions.