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

Trend · papers per month

4285127169 · Jun 202019922001200920172026
48 results for unbounded support

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.

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 ↗

Theory for deep neural network approximation of score function and its derivatives.

problem Handling data distributions with low-dimensional structure and unbounded support.
method Simultaneous approximation of the score function and its derivatives using deep neural networks.
result Approximation error bounds match literature but relax bounded support requirement.

KSG mutual information estimator, which is based on the distances of each sample to its k-th nearest neighbor, is widely used to estimate mutual information between two continuous random variables. Existing work has analyzed the convergence rate of this estimator for random variables whose densities are bounded away fr…

2018-10-27abs ↗pdf ↗

Efficient method for learning continuous exponential families beyond Gaussian.

problem Learning continuous exponential families with unbounded support.
method Interaction Screening approach for scalable learning of continuous graphical models.
result Our estimator maintains similar accuracy and sample complexity scalings compared to alternative approaches, while improving run-time.

Improved SGD with AdaGrad stepsizes adapts to unknown parameters and unbounded gradients.

problem Adaptive optimization with unknown parameters and unbounded gradients.
method Stochastic Gradient Descent with AdaGrad stepsizes, without assuming problem parameters or strong global Lipschitz conditions.
result Sharp rates of convergence in both low-noise and high-noise regimes, supporting an affine variance noise model.

Given a completely arbitrary surface, whether or not it has bounded curvature, or even whether or not it is complete, there exists an instantaneously complete Ricci flow evolution of that surface that exists for a specific amount of time [GT11]. In the case that the underlying Riemann surface supports a hyperbolic metr…

2013-02-22abs ↗pdf ↗

AdaGrad-Norm achieves optimal convergence rates for non-convex objectives without tuning.

problem Optimal convergence rates for non-convex, smooth objectives with adaptive step sizes.
method Adaptive SGD (AdaGrad-Norm) with self-tuning step sizes, analyzing under unbounded gradients and affine variance scaling.
result AdaGrad-Norm achieves order optimal convergence rate of $\mathcal{O}\left(\frac{\mathrm{poly}\log(T)}{\sqrt{T}} ight)$ under optimal assumptions.

Financial exchange operators cater to the needs of their users while simultaneously ensuring compliance with the financial regulations. In this work, we focus on the operators' commitment for fair treatment of all competing participants. We first discuss unbounded temporal fairness and then investigate its implementati…

2019-11-20abs ↗pdf ↗

The paper analyzes kNN density estimation's convergence rates under different conditions.

problem Analyzing convergence rates of kNN density estimation under bounded and unbounded support conditions.
method Examined two cases: bounded support with known and unknown support sets, and unbounded support with smooth density function.
result kNN density estimation is minimax optimal under certain conditions and better than kernel density estimation in some cases.

Paper develops estimators for unbounded density ratios with applications in error control.

problem Estimating density ratios with unbounded domains and ranges.
method Least squares and logistic regression loss functions for density ratio estimation.
result Established upper bounds on estimation errors with optimal rates for unbounded density ratios.

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this paper, we provide a novel framework to obtain uniform deviation bounds for loss…

2017-02-27abs ↗pdf ↗

In most papers establishing consistency for learning algorithms it is assumed that the observations used for training are realizations of an i.i.d. process. In this paper we go far beyond this classical framework by showing that support vector machines (SVMs) essentially only require that the data-generating process sa…

2007-07-02abs ↗pdf ↗

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.

New bounds on continuous random variables' right-tail probabilities.

problem Finding precise upper and lower limits for right-tail probabilities of continuous random variables.
method Developed new bounds based on PDF, first derivative, and two parameters.
result The new bounds are tight for various continuous random variables.

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 ↗

Traditional plane-based clustering methods measure the cost of within-cluster and between-cluster by quadratic, linear or some other unbounded functions, which may amplify the impact of cost. This letter introduces a ramp cost function into the plane-based clustering to propose a new clustering method, called ramp-base…

2018-12-10abs ↗pdf ↗

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.

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.

In this paper we study the geometry and the topology of unbounded domains in the Hyperbolic Space Hn\mathbb{H} ^n supporting a bounded positive solution to an overdetermined elliptic problem. Under suitable conditions on the elliptic problem and the behaviour of the bounded solution at infinity, we are able to show tha…

2015-11-09abs ↗pdf ↗

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 ↗