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

Trend · papers per month

275480107 · Jun 202019922001200920172026
48 results for Unbounded Perturbations

Advances FTPL results for bandit problems with unbounded perturbations.

problem Improving analytical foundations of FTPL in bandit problems.
method Revisiting classical FTRL-FTPL duality for unbounded perturbations.
result Establishes Best-of-Both-Worlds (BOBW) results for FTPL under a broad family of asymmetric unbounded perturbations.

In this paper, we propose a novel perturbation-based exploration method in bandit algorithms with bounded or unbounded rewards, called residual bootstrap exploration (\texttt{ReBoot}). The \texttt{ReBoot} enforces exploration by injecting data-driven randomness through a residual-based perturbation mechanism. This nove…

2020-02-19abs ↗pdf ↗

Study stability of contingent claim solutions under probabilistic perturbations.

problem Stability of solutions to discrete-time contingent-claim problems under uncertainty.
method Use Rockafellian perturbations to analyze stability of solutions.
result Establishes convergence of dual problems and shadow prices.

Over recent years, devising classification algorithms that are robust to adversarial perturbations has emerged as a challenging problem. In particular, deep neural nets (DNNs) seem to be susceptible to small imperceptible changes over test instances. However, the line of work in provable robustness, so far, has been fo…

2019-05-28abs ↗pdf ↗

Proves hard Lefschetz theorem and Hodge-Riemann relations for convex valuations.

problem Proving properties of convex valuations analogous to Kähler manifolds.
method Elliptic operator theory and perturbation theory applied to unbounded operators on a Hilbert space.
result Establishes hard Lefschetz theorem and Hodge-Riemann relations for convex bodies.

Two new algorithms improve performance in adversarial bandits with unbounded losses.

problem Adversarial Multi-Armed Bandits with unbounded losses.
method Developed UMAB-NN and UMAB-G for non-negative and general unbounded losses respectively.
result UMAB-NN achieves the first adaptive and scale-free regret bound for non-negative unbounded losses.

In this paper, we consider the heat flow for Yang-Mills connections on R5×SO(5)\mathbb{R}^5 \times SO(5). In the SO(5)SO(5)-equivariant setting, the Yang-Mills heat equation reduces to a single semilinear reaction-diffusion equation for which an explicit self-similar blowup solution was found by Weinkove \cite{Wei04}. We prove …

2016-04-26abs ↗pdf ↗

The paper examines gravitational singularities in spacetimes and proves inextendibility.

problem Investigating gravitational singularities in spacetimes.
method Analyzing local holonomy and using it to prove inextendibility.
result Proves the Cloc0,1C^{0,1}_{\mathrm{loc}}-inextendibility of certain spacetimes.

This memoir presents a systematic study of the utility maximization problem of an investor in a constrained and unbounded financial market. Building upon the work of Hu et al. (2005) [Ann. Appl. Probab., 15, 1691--1712] in a bounded framework, we extend our analysis to the more challenging unbounded case. Our methodolo…

2017-07-01abs ↗pdf ↗

It is shown that the compactly supported identity component of the diffeomorphism group of the 2-dimensional punctured torus Tp2\mathbb T^2_p is an unbounded group. It follows that the fragmentation norm of Tp2\mathbb T^2_p is unbounded.

2011-03-18abs ↗pdf ↗

SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.

problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and 2\ell_2-norm switching costs, with spectral regret analysis.
result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.

New inequalities for unbounded functions improve denoising score matching.

problem Statistical error bounds for denoising score matching with unbounded objective functions.
method Derive new concentration inequalities using McDiarmid's inequality and Rademacher complexity bounds.
result Improved statistical error bounds for denoising score matching.

Study focal surfaces of wave fronts with unbounded curvatures.

problem Characterizing singularities of focal surfaces near non-degenerate singular points.
method Characterizations based on types of singularities and geometrical properties of initial fronts.
result Investigation of Gaussian curvature behavior of focal surfaces.

Algorithm learns from both labeled and arbitrary test examples, giving guarantees for bounded VC dimension classes.

problem Learning from arbitrary test examples, not just perturbations.
method Selective transductive learning algorithm that outputs abstaining predictions.
result Nontrivial guarantees for bounded VC dimension classes with arbitrary train and test distributions.

We continue the study of statistical/computational tradeoffs in learning robust classifiers, following the recent work of Bubeck, Lee, Price and Razenshteyn who showed examples of classification tasks where (a) an efficient robust classifier exists, in the small-perturbation regime; (b) a non-robust classifier can be l…

2019-02-04abs ↗pdf ↗

Study shows unbounded Pontryagin numbers on curved manifolds.

problem Understanding unbounded Pontryagin numbers on curved manifolds.
method Analyzing rational linear combinations of Pontryagin numbers and their relation to the universal elliptic genus.
result Proves existence of unbounded Pontryagin numbers on nonnegatively curved spin manifolds.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

New approach finds solutions to games with unbounded controls.

problem Existence of equilibrium in mean-field games with unbounded controls.
method Weak formulation and new existence/stability results for quadratic-growth generalized McKean-Vlasov BSDEs.
result Existence of equilibrium result for non-Markovian mean-field games with unbounded control space.

The paper provides gradient estimates for Neumann semigroups on manifolds with boundary under unbounded curvature conditions.

problem Gradient estimates for Neumann semigroups on manifolds with boundary under unbounded curvature conditions.
method Establishes Bismut-type formulas and gradient estimates for Feynman--Kac semigroups on Riemannian manifolds with boundary, under geometric conditions formulated in terms of Ricci curvature and second fundamental form.
result Derives pointwise gradient estimates for the Neumann semigroup under variable, possibly unbounded, lower curvature bounds.

Improved sampling from Gaussian distributions with privacy constraints.

problem Sampling from unbounded Gaussian distributions with differential privacy.
method First $\widetilde{\mathcal{O}}\left(d ight)$-sample algorithm for unbounded Gaussians under $\left(\varepsilon, δ ight)$-differential privacy.
result A quadratic improvement over previous results, settling an open question.

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality CDE(n,K)CDE'(n,K), which can be regarded as a notion of curvature on graphs. Furthermore, we obtain some applications of Li-Yau inequality, including Harnack inequality, hea…

2018-01-18abs ↗pdf ↗

Study unbounded sl3\mathfrak{sl}_3-laminations around punctures.

problem Classify and understand structures of sl3\mathfrak{sl}_3-laminations at punctures.
method Relate to root data, classify signed webs, describe tropicalization, clarify relationships with other approaches.
result Clarify the relationship between sl3\mathfrak{sl}_3-laminations and other approaches.

We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body CRn+1C\subset \mathbb{R}^{n+1}, without assuming any further regularity on the boundary of CC. Motivated by an example of an unbounded convex body with null isoperimetric profile, we introduce the concept of…

2016-06-13abs ↗pdf ↗

Solves open problem on universally consistent online learning with unbounded losses.

problem Open problem on universally consistent online learning with unbounded losses.
method Constructs random measurable partitions of the instance space.
result Simple memorization rule is optimistically universal for any unbounded loss.