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

Trend · papers per month

15304459 · Jun 202019922001200920172026
48 results for upper-bounds

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.

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 ↗

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 ↗

A new upper bound for variational inference improves the efficiency of Bayesian deep learning.

problem Improving variational inference in Bayesian deep learning.
method Presented a new upper bound (EUBO) for evidence, derived from KL-divergence and log marginal likelihood, and used SGD for optimization.
result The new upper bound (EUBO) is tighter than previous methods and outperforms state-of-the-art results in Bayesian neural networks.

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 π.

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.

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.

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 ↗

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.

Sharp upper bounds derived for capacities in hyperbolic and Euclidean spaces.

problem Finding upper limits for the capacity of compact sets in hyperbolic and Euclidean spaces.
method Inverse mean curvature flow, unit-speed normal flow, weak inverse mean curvature flow, inverse anisotropic mean curvature flow.
result Various sharp upper bounds for the pp-capacity of compact sets in hyperbolic and Euclidean spaces are derived.

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.

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 ↗

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.

Upper bounds for magnetic Laplacian eigenvalues on planar domains.

problem Estimating the ground state energy of magnetic Laplacian on planar domains.
method Gauge invariance, flux analysis, and Cheeger-type constants.
result Upper bounds on the ground state energy depending on the ratio of holes to area, with sharpness and optimality conditions.

Optimal volume limit found for Kähler manifolds with positive Ricci curvature.

problem Bounding the volume of Kähler manifolds with positive Ricci curvature.
method Using δ-invariants and Newton--Okounkov bodies.
result Derive the optimal volume upper bound and new characterization of the complex projective space.

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue of the pp-Laplacian. In the case of the closed eigenvalue problem and the Neuma…

2019-07-08abs ↗pdf ↗

Upper bound on Stiefel manifold's injectivity radius found.

problem Finding the maximum distance within which the Stiefel manifold remains injective.
method Exhibited conjugate points and calculated the minimum of geodesic lengths.
result Upper bound on Stiefel manifold's injectivity radius is conjectured to be equal to the injectivity radius.

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 δδ.

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.

Upper bounds for volumes of hyperbolic polyhedra and links are derived.

problem Finding upper limits for volumes of generalized hyperbolic polyhedra and links.
method Application of Belletti's theorem and analysis of polyhedra with triangular faces and trivalent vertices.
result Improved upper bounds for volumes of hyperbolic polyhedra and links are derived.

In 1991, Negami found an upper bound on the stick number s(K)s(K) of a nontrivial knot KK in terms of the minimal crossing number c(K)c(K) of the knot which is s(K)2c(K)s(K) \leq 2 c(K). In this paper we improve this upper bound to s(K)32(c(K)+1)s(K) \leq \frac{3}{2} (c(K)+1). Moreover if KK is a non-alternating prime knot, then $s(K) \leq…

2015-12-11abs ↗pdf ↗