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

99198297396 · May 202619922001200920172026
48 results for upper bound

This paper analyzes regret bounds for Gaussian process Thompson sampling.

problem Analyzing the performance of Gaussian process Thompson sampling (GP-TS) in Bayesian optimization.
method The paper derives several regret bounds for GP-TS, including a lower bound, upper bounds on the second moment of cumulative regret, expected lenient regret, and improved cumulative regret.
result The paper provides improved regret upper bounds for GP-TS, showing that it suffers from a polynomial dependence on 1/δ1/δ with probability δδ.

Sharp upper bounds found for Steklov eigenvalues of a specific hypersurface.

problem Finding upper bounds for Steklov eigenvalues of a specific type of hypersurface.
method Analytical approach to compute upper bounds and prove stability properties.
result Sharp upper bounds Bn(L)B_n(L) and BnB_n for Steklov eigenvalues are derived.

Study proves upper bounds for solutions on Riemannian manifolds.

problem Proving upper bounds for solutions of Leibenson's equation on Riemannian manifolds.
method Proved upper bounds equivalent to a euclidean-type Sobolev inequality.
result Upper bounds for solutions of Leibenson's equation on Riemannian manifolds are equivalent to euclidean-type Sobolev inequalities.

Upper bounds for Steklov eigenvalues derived from intersection indices.

problem Finding upper bounds for Steklov eigenvalues of submanifolds in Euclidean space.
method Using intersection indices of submanifolds and their boundaries.
result Explicit upper bounds involving intersection index, volume, and dimensional constants.

Upper bound for conjugate radius in open manifolds with scalar curvature and spectrum constraints.

problem Bounding the conjugate radius of open manifolds with specific curvature and spectrum conditions.
method Established an upper bound using scalar curvature and bottom-of-spectrum constraints.
result For certain conditions, the conjugate radius is no more than π.

We obtain upper bounds for the eigenvalues of the Schrödinger operator L=Δg+qL=Δ_g+q depending on integral quantities of the potential qq and a conformal invariant called the min-conformal volume. Moreover, when the Schrödinger operator LL is positive, integral quantities of qq which appear in upper bounds, can be repla…

2012-10-29abs ↗pdf ↗

New examples show no upper bounds on link volumes on incompressible surfaces.

problem Finding upper bounds on volumes of links on incompressible surfaces.
method Examined weakly generalised alternating and fully augmented links on incompressible surfaces.
result Found infinite families of links on incompressible surfaces with no upper bounds on volume.

Let M{\mathfrak M} be a closed, orientable, hyperbolic 3-orbifold such that π1(M)π_1({\mathfrak M}) contains no hyperbolic triangle group. We show that strict upper bounds of 0.07625, 0.1525 and 0.22875 for vol M{\rm vol}\ {\mathfrak M} imply respective upper bounds of 23, 43 and 79 for $\dim H_1({\mathfrak M};{\mathbb F}_2…

2019-04-24abs ↗pdf ↗

Paper presents a reduction-based framework for conservative bandits and RL with improved lower and upper bounds.

problem Conservative bandits and reinforcement learning problems.
method Reduction technique to calculate necessary and sufficient budget from baseline policy.
result Improved lower and upper bounds for various conservative settings.

A new method to measure neural network expressiveness using tighter upper bounds.

problem Measuring the expressiveness of deep neural networks (DNNs).
method Proposes a new tighter upper bound for the number of linear regions in rectifier networks, using matrix computation.
result The proposed upper bound is tighter than existing ones and explains the performance improvements of skip connections and residual structures.

Stochastic variational inference (SVI) plays a key role in Bayesian deep learning. Recently various divergences have been proposed to design the surrogate loss for variational inference. We present a simple upper bound of the evidence as the surrogate loss. This evidence upper bound (EUBO) equals to the log marginal li…

2019-12-02abs ↗pdf ↗

Upper bound found for Steklov eigenvalue of a surface of revolution.

problem Finding an upper limit for Steklov eigenvalues of a specific surface.
method Analyzing a surface of revolution with boundary conditions of two spheres.
result An upper bound for the first Steklov eigenvalue is derived and shown to be sharp in some cases.

Upper bounds found for eigenvalues of weighted Steklov and (p,q)-Laplacian problems.

problem Finding upper bounds for eigenvalues of weighted Steklov and (p,q)-Laplacian problems.
method Proving upper bounds using the weighted p-Laplace operator and (p,q)(p,q)-Laplacian on submanifolds.
result Reilly-type upper bounds for the first eigenvalues of Steklov and (p,q)-Laplacian problems.

The study finds polynomial upper bounds for singularities in Einstein-scalar field system.

problem Understanding the strength of singularities in gravitational collapse.
method Analyzing geometric quantities, focusing on the Kretschmann scalar.
result Polynomial blow-up upper bounds O(1/rN)O(1/r^N) for the Kretschmann scalar, improving previous bounds.

New bounds for Bayesian bandits show prior improves performance.

problem Improving regret bounds for Bayesian bandits.
method Upper confidence bound algorithm with finite-time logarithmic regret bounds.
result Derives O(cΔlogn)O(c_Δ\log n) and O(chlog2n)O(c_h \log^2 n) upper bounds for Bayesian bandits.

Study sets a nontrivial upper limit on return forecasting accuracy.

problem Establishing a practical upper limit for return forecasting accuracy.
method Defined a coin-flip oracle model to theoretically outperform practical models and used its RextOOS2R^2_{ ext{OOS}} as an upper bound.
result Theoretical upper bound on RextOOS2R^2_{ ext{OOS}} is a quadratic function of directional accuracy.

Paper improves regret bounds for Gaussian process upper confidence bound in Bayesian optimization.

problem Minimizing regret in Gaussian process bandit optimization.
method Gaussian process upper confidence bound (GP-UCB) algorithm with refined analysis.
result Achieves O(Tln2T)O(\sqrt{T \ln^2 T}) cumulative regret under squared exponential kernel.

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of …

2018-09-06abs ↗pdf ↗

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.

We extend Bayes' theorem for upper probabilities considering likelihood uncertainty.

problem Addressing uncertainty in likelihood for upper probability bounds.
method Generalization of Wasserman and Kadane's result, considering both prior and likelihood uncertainty.
result A sufficient condition for the upper bound to become an equality.

We give a characterization of critical points that allows us to define a metric invariant on all Riemannian manifolds MM with a lower sectional curvature bound and an upper radius bound. We show there is a uniform upper volume bound for all such manifolds with an upper bound on this invariant. We generalize results by…

2014-08-23abs ↗pdf ↗

New method improves understanding of machine learning model performance.

problem Understanding how well machine learning models generalize from training data to unseen data.
method Auxiliary Distribution Method to derive new generalization error bounds.
result Upper bounds on generalization errors are tighter and more applicable.

In this paper, we will present some characterizations for the upper bound of the Bakry-Emery curvature on a Riemannian manifold by using functional inequalities on path space. Moreover, some characterizations for general lower and upper bounds of Ricci curvature are also given, which extends the recent results derived …

2016-12-12abs ↗pdf ↗