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

19385675 · Jun 202019922001200920172026
48 results for logarithmic concavity

Near-logarithmic regret per switch achieved for mixable/exp-concave losses.

problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.

This paper resolves a longstanding open question pertaining to the design of near-optimal first-order algorithms for smooth and strongly-convex-strongly-concave minimax problems. Current state-of-the-art first-order algorithms find an approximate Nash equilibrium using O~(κx+κy)\tilde{O}(κ_{\mathbf x}+κ_{\mathbf y}) or $\tild…

2020-02-05abs ↗pdf ↗

We discuss a certain Riemannian metric, related to the toric Kahler-Einstein equation, that is associated in a linearly-invariant manner with a given log-concave measure in R^n. We use this metric in order to bound the second derivatives of the solution to the toric Kahler-Einstein equation, and in order to obtain spec…

2013-09-11abs ↗pdf ↗

The study improves fundamental gap estimates for surfaces with non-constant positive curvature.

problem Estimating the fundamental gap for surfaces with non-constant positive curvature.
method Using a two-point maximum principle, the study establishes log-concavity and fundamental gap estimates.
result Corresponding log-concavity and fundamental gap estimates for surfaces with non-constant positive curvature are derived.

The overarching goal of this paper is to derive excess risk bounds for learning from exp-concave loss functions in passive and sequential learning settings. Exp-concave loss functions encompass several fundamental problems in machine learning such as squared loss in linear regression, logistic loss in classification, a…

2014-01-18abs ↗pdf ↗

Polynomial mixing times for simulated tempering in mixture sampling problems.

problem Sampling from mixtures of log-concave distributions with location shifts.
method Conductance decomposition applied to an auxiliary Markov chain on an augmented space.
result First polynomial-time guarantee for simulated tempering with MALA.

ULA estimates covariance of log-concave distributions efficiently.

problem Estimating covariance matrices of log-concave distributions efficiently.
method Unadjusted Langevin algorithm (ULA) for sampling and covariance estimation.
result Sample complexity of single-chain ULA is smaller than that of parallel ULA by a logarithmic factor.

Paper analyzes complexity of solving nonconvex-strongly-concave problems.

problem Finding approximate stationary points of nonconvex-strongly-concave minimax problems.
method Introduces a generic acceleration scheme to solve crafted subproblems.
result Algorithm nearly matches lower complexity bounds in general setting.

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.

Let M be a compact, connected symplectic 2n-dimensional manifold on which an(n-2)-dimensional torus T acts effectively and Hamiltonianly. Under the assumption that there is an effective complementary 2-torus acting on M with symplectic orbits, we show that the Duistermaat-Heckman measure of the T-action is log-concave.…

2012-07-05abs ↗pdf ↗

We study the decades-old problem of online portfolio management and propose the first algorithm with logarithmic regret that is not based on Cover's Universal Portfolio algorithm and admits much faster implementation. Specifically Universal Portfolio enjoys optimal regret O(NlnT)\mathcal{O}(N\ln T) for NN financial instrum…

2018-05-18abs ↗pdf ↗

Study minimax risk of score estimation for log-concave distributions.

problem Minimizing risk in score estimation for log-concave distributions.
method Developed subclasses of log-concave densities and constructed a locally adaptive, multiscale estimator.
result Established minimax rates for score estimation over specific subclasses of log-concave densities.

Investigates how rebalancing frequency and transaction costs affect log-optimal portfolios.

problem Impact of rebalancing frequency and transaction costs on log-optimal portfolios.
method Proved equivalence to concave program, derived optimality conditions, tested using intraday and daily data.
result Transaction costs can cause bankruptcy for frequency-dependent log-optimal portfolios, approximating to quadratic concave program.

Sharp 2-Wasserstein bounds for DDPMs derived from Föllmer process.

problem Sampling error bounds for DDPMs in 2-Wasserstein distance.
method Lipschitz-type conditions on score function, Föllmer process, and log-concave target distributions.
result Sharp upper bounds for DDPMs in 2-Wasserstein distance, optimal in dimension and steps.

The paper extends entropy formulas to super Ricci flows on metric measure spaces.

problem Entropy formulas for super Ricci flows on metric measure spaces.
method Extending Perelman's WW-entropy and Shannon entropy power to super Ricci flows.
result Equivalence between volume non-local collapsing property and lower boundedness of WW-entropy on RCD(0,N)(0, N) spaces.

New algorithm for reinforcement learning reduces complexity and guarantees convergence.

problem Reinforcement learning problems with convex occupancy measures.
method MD-CURL, inspired by mirror descent, uses non-standard regularization.
result Achieves convergence guarantees and simple closed-form solution.

Paper proposes efficient cost functions for automated market makers in DeFi.

problem Inefficient and computationally complex cost functions in DeFi.
method Proposes and analyzes constant circle/ellipse based cost functions.
result Proposed cost functions are computationally efficient and robust against attacks.

Improved sampling for high-dimensional posteriors with underdamped Langevin.

problem Scalability issues in high-dimensional problems with approximate Thompson sampling.
method Underdamped Langevin Monte Carlo for accelerated posterior concentration.
result Logarithmic regret improvement from ildeO(d)\mathcal{ ilde O}(d) to ildeO(d)\mathcal{ ilde O}(\sqrt{d}).

New schemes improve error estimates for sampling from non-log-concave distributions.

problem Improving sampling from non-log-concave distributions with super-linear drift growth.
method Developed tamed Euler and randomized Euler schemes with error estimates.
result Near-optimal error bounds for sampling and optimization problems.

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schrödinger operator with convex potential and Dirichlet boundary data on a convex domain is bounded below by the spectral gap on an interval of the same diameter with zero poten…

2010-06-09abs ↗pdf ↗

For φφ a metric on the anticanonical bundle, KX-K_X, of a Fano manifold XX we consider the volume of XX Xeφ. \int_X e^{-φ}. We prove that the logarithm of the volume is concave along bounded geodesics in the space of positively curved metrics on KX-K_X and that the concavity is strict unless the geodesic comes from…

2013-03-20abs ↗pdf ↗

The unadjusted Langevin algorithm converges faster for some variables in high dimensions.

problem Sampling probability distributions in high-dimensional settings.
method Analysis of the unadjusted Langevin algorithm for strongly log-concave distributions.
result The delocalization of bias effect allows for faster convergence for a small number of variables.

New algorithms minimize dynamic regret in non-stationary online learning.

problem Universal dynamic regret minimization under exp-concave and smooth losses.
method Strongly Adaptive algorithms with a path variational based on second order differences of the comparator sequence.
result Achieve a dynamic regret of ildeO(d2n1/5Cn2/5d2) ilde O(d^2 n^{1/5} C_n^{2/5} \vee d^2), optimal modulo dependencies.

We consider saddle point problems which objective functions are the average of nn strongly convex-concave individual components. Recently, researchers exploit variance reduction methods to solve such problems and achieve linear-convergence guarantees. However, these methods have a slow convergence when the condition n…

2019-09-13abs ↗pdf ↗

This paper tackles bandit optimization with a new pairwise comparison oracle for unknown strongly concave functions.

problem Maximizing an unknown strongly concave function over T periods with a biased pairwise comparison oracle.
method Introduced a discretization technique and local polynomial approximation to relate the problem to linear bandits. Developed a tournament successive elimination technique to localize the discretized cell and run LinUCB algorithm on cells.
result Established optimal regret bounds and improved state-of-the-art results in operations management problems.

Paper optimizes approximating high-dimensional diffusions by independent coordinates.

problem Optimizing approximations of high-dimensional diffusions by independent coordinates.
method Introduces independent projection as optimal for two criteria.
result Independent projection is optimal for two criteria related to entropy and convergence.

Study improves sampling from non-log-concave distributions using Fisher information.

problem Sampling from non-log-concave distributions with high Fisher information guarantees.
method Proximal sampler with RGO implementation, leveraging log-concave sampling results.
result Improved complexity guarantee in relative Fisher information for non-log-concave sampling.

Established concavity principle for curved spaces.

problem Solving equations on curved spaces with nonnegative curvature.
method Applied concavity principle to elliptic and parabolic equations on locally symmetric spaces with nonnegative curvature.
result First general concavity principle on spaces with non-constant sectional curvature.

Establishes log-concavity estimates for convex domains' first Dirichlet eigenfunctions.

problem Quantifying the Hessian of log-concave eigenfunctions on convex domains.
method Analyzes log-concavity properties of the first Dirichlet eigenfunction on convex domains.
result Obtains quantitative estimates for the Hessian of logu\log u.

New saddle network architectures preserve convex-concave geometry in optimization problems.

problem Optimization models with convex x and concave y components.
method Structured separable decomposition and saddle network architectures.
result Proven one-dimensional approximation theorem and high accuracy on various test functions.

We present a simple connection between differential Harnack inequalities for hypersurface flows and natural concavity properties of their time-of-arrival functions. We prove these concavity properties directly for a large class of flows by applying a concavity maximum principle argument to the corresponding level set f…

2019-12-13abs ↗pdf ↗

We define a class of L-convex-concave subsets of RPn\Bbb{R}P^n, where L is a projective subspace of dimension l in RPn\Bbb{R}P^n. These are sets whose sections by any (l+1)-dimensional space L' containing L are convex and concavely depend on L'. We introduce an L-duality for these sets, and prove that the L-dual to an L-…

2002-03-19abs ↗pdf ↗

Geodesic concavity and hypersymplectic structures in G2G2-structures space.

problem Analyzing the geodesic concavity and hypersymplectic structures in the space of closed G2G2-structures.
method Utilising the geodesic constructed in the previous article, we show geodesic concavity and decrease in length of G2G2 Laplacian flow.
result Hitchin's volume functional is geodesically concave and the G2G2 Laplacian flow decreases the length.