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.
In this paper, we prove the concavity of p-entropy power of probability densities solving the p-heat equation on closed Riemannian manifold with nonnegative Ricci curvature. As applications, we give new proofs of Lp-Euclidean Nash inequality and Lp-Euclidean Logarithmic Sobolev inequality, moreover, an improv…
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…
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…
For φ a metric on the anticanonical bundle, −KX, of a Fano manifold X we consider the volume of X∫Xe−φ. We prove that the logarithm of the volume is concave along continuous geodesics in the space of positively curved metrics on −KX and that the concavity is strict unless the geodesic comes f…
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.…
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) for N financial instrum…
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…
Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems. The main contribution of this paper is the design and analysis of new stochastic primal-d…
We consider a contextual version of multi-armed bandit problem with global knapsack constraints. In each round, the outcome of pulling an arm is a scalar reward and a resource consumption vector, both dependent on the context, and the global knapsack constraints require the total consumption for each resource to be bel…
For φ a metric on the anticanonical bundle, −KX, of a Fano manifold X we consider the volume of X∫Xe−φ. We prove that the logarithm of the volume is concave along bounded geodesics in the space of positively curved metrics on −KX and that the concavity is strict unless the geodesic comes from…
We consider saddle point problems which objective functions are the average of n 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…
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.
In this paper, we give an easy proof of the main results of Andrews and Clutterbuck's paper [J. Amer. Math. Soc. 24 (2011), no. 3, 899--916], which gives both a sharp lower bound for the spectral gap of a Schröinger operator and a sharp modulus of concavity for the logarithm of the corresponding first eigenfunction. We…
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…
We define a class of L-convex-concave subsets of RPn, where L is a projective subspace of dimension l in RPn. 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-…