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

9182635 · May 202619922001200920172026
48 results for KL_inf

This paper tightens the law of the iterated logarithm for empirical KL_inf, applicable to unbounded data.

problem Developing nonasymptotic concentration bounds for empirical KL_inf with optimal constants and rates.
method Presenting a tight law of the iterated logarithm for empirical KL_inf, applicable to unbounded data.
result A tight law of the iterated logarithm for empirical KL_inf, applicable to unbounded data.

Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of 12\frac12 for a suitable potential function is related to local linear convergence. Nevertheless, KL exponent is in general extremely hard to estimate. I…

2019-02-10abs ↗pdf ↗

INF-clip optimizes heavy-tailed MAB problems with improved performance.

problem Optimizing multi-armed bandit problems with heavy-tailed rewards.
method INF-clip algorithm for adversarial and stochastic heavy-tailed MAB settings.
result INF-clip is optimal for linear and non-linear heavy-tailed stochastic MAB problems.

In this paper we will discuss the optimal risk transfer problems when risk measures are generated by G-expectations, and we present the relationship between inf-convolution of G-expectations and the inf-convolution of drivers G.

2009-10-28abs ↗pdf ↗

Study risk sharing among agents with varying risk preferences.

problem Risk sharing among agents with heterogeneous risk measures.
method Derive explicit solutions for inf-convolution and counter-monotonic inf-convolution under varying risk seeking.
result Explicit solutions for inf-convolution and counter-monotonic inf-convolution can be represented by a generalization of distortion risk measures.

SurvLIME-Inf simplifies explanation of survival models using a linear programming approach.

problem Explain complex survival models using simple linear programming.
method Uses LL_{\infty }-norm for feature importance and explains black-box models.
result SurvLIME-Inf outperforms SurvLIME in small training set scenarios.

The paper studies properties of optimal metrics associated to curves on surfaces.

problem Investigating properties of optimal metrics associated to curves on surfaces.
method Starting from a filling curve and a separating curve, constructing a two integer parameter family of curves and deriving coarse length bounds and qualitative properties of their associated optimal metrics.
result There are infinitely many pairs of filling curves with distinct inf invariants but the same self-intersection number.

Study uncovers new phase transitions in asymmetric causal inference scenarios.

problem Understanding typical phase transitions in asymmetric causal inference.
method Combining Causal inference (C-inf) and Low-rank recovery (LRR) with Random duality - Free probability theory (RDT-FPT).
result Discovering a doubling low-rankness phenomenon in asymmetric scenarios.

We give some a priori estimates of type sup*inf for Yamabe and prescribed scalar curvature type equations on Riemannian manifolds of dimension >2. The product sup*inf is caracteristic of those equations, like the usual Harnack inequalities for non negative harmonic functions. First, we have a lower bound for sup*inf fo…

2006-04-25abs ↗pdf ↗

Let MnRn+1M^n\subset\mathbb R^{n+1} be the graph of a C2C^2-real valued function defined in a closed ball of Rn\mathbb R^n. In this work, we obtain upper bounds for infMH\inf_M|H| and infMR\inf_M|R|, where HH and RR are, respectively, the mean curvature and the scalar curvature of MnM^n, generalizing estimates given by Heinz i…

2009-04-06abs ↗pdf ↗

Optimizes convex functions in finite vs infinite dimensions, revealing slow convergence rates.

problem Analyzing gradient flows in finite and infinite-dimensional Hilbert spaces.
method Proves convergence rates and optimality conditions for gradient flows and related methods.
result Gradient flow convergence rates in finite dimensions are slower than in infinite dimensions, with optimal rates achievable in Hilbert spaces.

Improved regret bounds for Tsallis-INF in adversarial bandits and corruptions.

problem Adversarial bandits and corruptions in multiarmed bandit problems.
method Improved regret bounds for Tsallis-INF algorithm.
result Achieves $\mathcal{O}\left(\left(\sum_{i eq i^*} \frac{1}{Δ_i} ight)\log_+\left(\frac{(K-1)T}{\left(\sum_{i eq i^*} \frac{1}{Δ_i} ight)^2} ight)+\sqrt{C\left(\sum_{i eq i^*}\frac{1}{Δ_i} ight)\log_+\left(\frac{(K-1)T}{C\sum_{i eq i^*}\frac{1}{Δ_i}} ight)} ight)$ regret bound.

We connect Causal inference and low-rank recovery via RDT and free probability theory.

problem Determining the applicability of causal inference via low-rank recovery.
method Random Duality Theory, free probability theory, and mathematical rigor.
result Exact closed-form worst case phase transitions for causal inference.

In this paper, we study a family of non-convex and possibly non-smooth inf-projection minimization problems, where the target objective function is equal to minimization of a joint function over another variable. This problem include difference of convex (DC) functions and a family of bi-convex functions as special cas…

2019-08-26abs ↗pdf ↗

We study the existence of optimal actions in a zero-sum game infτsupPEP[Xτ]\inf_τ\sup_PE^P[X_τ] between a stopper and a controller choosing a probability measure. This includes the optimal stopping problem infτE(Xτ)\inf_τ\mathcal{E}(X_τ) for a class of sublinear expectations E()\mathcal{E}(\cdot) such as the GG-expectation. We show that …

2012-12-10abs ↗pdf ↗

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which was left unsolved in both papers was the number m of times one must `cycle' (res…

2000-03-21abs ↗pdf ↗

The paper explores numerical characteristics of compact Riemannian manifolds and proves inequalities.

problem Analyzing numerical characteristics of compact Riemannian manifolds.
method Proving inequalities involving scalar curvature, Ricci curvature, and sectional curvature.
result Proven inequalities for the curvature of compact Riemannian manifolds.

In this paper, we consider an infinite dimensional exponential family, P\mathcal{P} of probability densities, which are parametrized by functions in a reproducing kernel Hilbert space, HH and show it to be quite rich in the sense that a broad class of densities on Rd\mathbb{R}^d can be approximated arbitrarily well i…

2013-12-12abs ↗pdf ↗

We define a new differential invariant a compact manifold by VM(M)=infgVc(M,[g])V_{\mathcal M}(M)=\inf_g V_c(M,[g]), where Vc(M,[g])V_c(M,[g]) is the conformal volume of MM for the conformal class [g][g], and prove that it is uniformly bounded above. The main motivation is that this bound provides a upper bound of the Friedlander-Nadirashvili…

2008-01-17abs ↗pdf ↗

TSC uses HMC and adaptive transport maps to optimize forward KL for variational inference.

problem Variational inference underestimates uncertainty when minimizing reverse KL.
method TSC uses Hamiltonian Monte Carlo and adaptive transport maps to optimize KL(p||q).
result TSC achieves competitive performance in training variational autoencoders on large-scale data.

A classic setting of the stochastic K-armed bandit problem is considered in this note. In this problem it has been known that KL-UCB policy achieves the asymptotically optimal regret bound and KL-UCB+ policy empirically performs better than the KL-UCB policy although the regret bound for the original form of the KL-UCB…

2019-03-19abs ↗pdf ↗

Improved fast rates for decision making with forward-KL regularization in contextual bandits.

problem Improving fast rates for decision making with forward-KL regularization in contextual bandits.
method Streamlined analysis of forward-KL-regularized offline CBs, exploiting the pessimism principle and convex-analytical pipeline.
result First ildeO(ε1) ilde{O}(ε^{-1}) upper bounds in tabular and general function approximation settings.

Lewis and Mordecki have computed the Wiener-Hopf factorization of a Lévy process whose restriction on ]0,+[]0,+\infty[ of their Lévy measure has a rational Laplace transform. That allows to compute the distribution of (Xt,inf0stXs)(X_t,\inf_{0\leq s\leq t}X_s). For the same class of Lévy processes, we compute the distribution of $ (…

2010-03-25abs ↗pdf ↗

Given a spacelike 2-surface ΣΣ in a spacetime NN and a constant future timelike unit vector T0T_0 in R3,1\R^{3,1}, we derive upper and lower estimates of Wang-Yau quasilocal energy E(Σ,X,T0)E(Σ, X, T_0) for a given isometric embedding XX of ΣΣ into a flat 3-slice in R3,1\R^{3,1}. The quantity E(Σ,X,T0) E(Σ, X, T_0) itself depends …

2009-09-04abs ↗pdf ↗

The paper develops new algorithms for KL-divergence NMF, proving convergence and performance.

problem Improving NMF for nonnegative data with KL divergence.
method Collect and analyze properties of KL objective function, propose and test new algorithms.
result Guaranteed non-increasing objective function for one proposed algorithm, global convergence.

Inf-FS selects features by graph paths, ranking them for infinite feature sets.

problem Feature selection in large datasets with relevance and redundancy.
method Graph-based feature selection with infinite paths, evaluating feature subsets using matrix power series and Markov chains.
result Inf-FS outperforms other methods in various feature selection scenarios.

Paper analyzes and improves KL-regularized RL for LLMs with logarithmic regret.

problem Improving efficiency of RL fine-tuning for large language models.
method Optimism-based KL-regularized online contextual bandit algorithm with novel regret analysis.
result Achieves an O(ηlog(NRT)dR)\mathcal{O}\big(η\log (N_{\mathcal R} T)\cdot d_{\mathcal R}\big) logarithmic regret bound.

Paper relaxes triangle inequality for KL divergence between Gaussian distributions.

problem KL divergence does not satisfy triangle inequality for Gaussian distributions.
method Investigates relaxed triangle inequality and finds supremum.
result Supremum of KL divergence is found and conditions for attaining it are determined.

Theory for RLHF generalization under reward shift and clipped KL.

problem Theoretical understanding of RLHF generalization, especially with reward shift and clipped KL.
method Developed generalization theory for RLHF, accounting for reward shift and clipped KL.
result Presented generalization bounds for RLHF, suggesting generalization error from sampling, reward shift, and KL clipping.

The Dirichlet mechanism protects privacy while minimizing KL divergence.

problem Minimizing KL divergence while protecting sensitive data privacy.
method Using the exponential mechanism with the KL divergence loss function, resulting in the Dirichlet mechanism.
result Proved a probability tail bound on KL divergence and derived a lower bound for sample complexity.

Paper analyzes sample complexity of offline MABs with KL regularization.

problem Optimizing sample complexity for offline decision-making with KL-regularized metrics.
method Sharp analysis of KL-PCB, providing upper and lower bounds.
result Characterizes sample complexity for offline MABs with KL regularization.