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

125250375500 · May 202619922001200920172026
48 results for bounded families

New insights into natural exponential families improve regret bounds for bandit problems.

problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.

In recent years, several families of hyperbolic knots have been shown to have both volume and λ1λ_1 (first eigenvalue of the Laplacian) bounded in terms of the twist number of a diagram, while other families of knots have volume bounded by a generalized twist number. We show that for general knots, neither the twist nu…

2009-01-02abs ↗pdf ↗

The paper studies families of curves on surfaces that realize all types of pants decompositions.

problem Finding the minimal size of families of curves on surfaces that realize all types of pants decompositions.
method Investigates exponential and superlinear bounds for surfaces without punctures, and provides bounds for surfaces with punctures.
result Provides bounds for the minimal size of families of curves on surfaces with and without punctures.

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.

The study provides a generalization bound for a family of implicit networks.

problem Theoretical understanding of implicit networks' generalization is limited.
method A generalization bound is derived for a family of implicit networks using a covering number argument for Rademacher complexity.
result A theoretical generalization bound is established for implicit networks.

Unified framework for understanding TVO and improving model learning.

problem Improving the tightness and efficiency of variational inference bounds.
method Exponential family interpretation and equal spacing in moment parameters.
result Unified framework and improved gradient estimator for TVO.

Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.

problem Finding sharp lower bounds for modular invariants and Dehn twist coefficients.
method Analyzing the relation between fractional Dehn twists and modular invariants, classifying pseudo-periodic maps, and proving rigidity properties.
result Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.

Bounds on geodesic distances on Stiefel manifold derived from new metrics.

problem Improving geodesic computation algorithms and understanding Stiefel manifold.
method New geometric insights and Lipschitz constants for geodesic distances.
result Explicit bounds on geodesic distances and conditions for attaining bounds.

In this paper we obtain a bound on the number of isometry classes of finite area hyperbolic surfaces which are length isospectral to a given surface depending only on the topological type of the surface and the length of the shortest closed geodesic on the surface. This will follow from a more general bound applying to…

2013-10-30abs ↗pdf ↗

Paper proves all Lagrangians unobstructed if one is, using non-archimedean analytic structure.

problem Proving the existence of bounding cochains for unobstructed Lagrangians.
method Introducing non-archimedean analytic structure and using family Floer techniques.
result All Lagrangians in a connected family are unobstructed if one is.

In the present paper, we consider the family of all compact Alexandrov spaces with curvature bound below having a definite upper diameter bound of a fixed dimension. We introduce the notion of essential coverings by contractible metric balls, and provide a uniform bound on the numbers of contractible metric balls formi…

2012-05-02abs ↗pdf ↗

We first show that a Laplace isospectral family of Riemannian orbifolds, satisfying a lower Ricci curvature bound, contains orbifolds with points of only finitely many isotropy types. If we restrict our attention to orbifolds with only isolated singularities, and assume a lower sectional curvature bound, then the numbe…

2003-01-30abs ↗pdf ↗

Proposes a general method to derive regret bounds for multi-armed bandit algorithms.

problem Deriving regret bounds for randomized multi-armed bandit algorithms.
method Checking sufficient conditions on sampling probabilities and distributions.
result Proves logarithmic regret bounds for various bandit algorithms and new models.

We show that dropout training is best understood as performing MAP estimation concurrently for a family of conditional models whose objectives are themselves lower bounded by the original dropout objective. This discovery allows us to pick any model from this family after training, which leads to a substantial improvem…

2018-05-23abs ↗pdf ↗

Paper improves generalization bounds for noisy stochastic algorithms.

problem Improving generalization bounds for noisy stochastic algorithms.
method Introduces Exponential Family Langevin Dynamics (EFLD) and establishes data-dependent expected stability based generalization bounds.
result Sharp generalization bounds with O(1/n) sample dependence and gradient discrepancy.

New 3-manifolds bound rational 4-balls through specific operations.

problem Finding rational homology 3-spheres that bound rational homology 4-balls.
method Two operations that preserve lattice embedding obstruction to bounding rational homology balls.
result Explicit examples of rational surgeries on torus knots that bound rational homology balls.

Paper finds infinite family of minimal triangulations for complex 3D shapes.

problem Finding minimal ideal triangulations for complex 3D shapes.
method Examined Dehn fillings on specific links to find minimal triangulations.
result Found an infinite family of minimal ideal triangulations for a specific type of 3D shape.

When choosing the right copula for our data a key point is to distinguish the family that describes it at the best. In this respect, a better choice of the copulas could be obtained through the information about the (non)symmetry of the data. Exchangeability as a probability concept (first next to independence) has bee…

2018-08-29abs ↗pdf ↗

For each rational homology 3-sphere YY which bounds simply connected definite 4-manifolds of both signs, we construct an infinite family of irreducible rational homology 3-spheres which are homology cobordant to YY but cannot bound any simply connected definite 4-manifold. As a corollary, for any coprime integers $p,…

2018-08-28abs ↗pdf ↗

In this paper we propose a family of tractable kernels that is dense in the family of bounded positive semi-definite functions (i.e. can approximate any bounded kernel with arbitrary precision). We start by discussing the case of stationary kernels, and propose a family of spectral kernels that extends existing approac…

2015-06-07abs ↗pdf ↗

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given closed braid diagram. We also show that the volumes for many of these closed braids…

2014-06-28abs ↗pdf ↗

In this paper we consider three arithmetic families of isospectral non-isometric Riemannian orbifolds and in each case derive an upper bound for the size of the family which is polynomial as a function of the volume of the orbifolds. The first family that we consider are those constructed by Vigneras' method. The secon…

2013-09-02abs ↗pdf ↗

New examples of Kirby-Ramanujam spheres found, leading to contractible 4-manifolds.

problem Finding new examples of Kirby-Ramanujam spheres.
method Tracing the initial steps of Kirby's example and providing additional examples, showing diffeomorphisms and linear independence.
result Found three infinite families of Kirby-Ramanujam spheres that bound contractible 4-manifolds.

Twisted torus knots and links are given by twisting adjacent strands of a torus link. They are geometrically simple and contain many examples of the smallest volume hyperbolic knots. Many are also Lorenz links. We study the geometry of twisted torus links and related generalizations. We determine upper bounds on their …

2010-07-17abs ↗pdf ↗

This article considers a one-parameter family of circles F_C, which has the interesting property that the null isocline of the family is the largest member of the family. This family of circles is bounded and we consider the problem of deriving an equation for the envelope of F_C. We provide one standard solution, and …

2007-03-02abs ↗pdf ↗

Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density function, explicit or not, as long as independent random samples can be generat…

2018-05-28abs ↗pdf ↗

We define a family of link concordance invariants {sn}n=2,3,\left\{ s_n \right\}_{n=2,3, \cdots}. These link concordance invariants give lower bounds on the slice genus of a link LL. We compute the slice genus of positive links. Moreover, these invariants give lower bounds on the link splitting number of a link. Especially, t…

2016-08-20abs ↗pdf ↗

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

New method for tensor completion using nonconvex dual total variation.

problem Tensor completion from partial measurements with exponential-family noise.
method Proposed dual-TV (DTV) regularizers for tensor completion under exponential-family noise.
result Theoretical upper bounds on recovery error for tensor completion.

We call an integral homology sphere non-trivially\textit{non-trivially} bounds a rational homology ball if it is obstructed from bounding an integral homology ball. After Fintushel and Stern's well-known example Σ(2,3,7)Σ(2,3,7), Akbulut and Larson recently provided the first infinite families of Brieskorn spheres non-trivially boundin…

2019-12-10abs ↗pdf ↗

Analyzes the complexity of linear hypothesis sets using Rademacher complexity.

problem Understanding the complexity of linear hypothesis sets for various norms.
method Tight analysis of empirical Rademacher complexity for linear hypothesis classes with bounded weights.
result Improved bounds on Rademacher complexity for linear hypothesis sets, matching or improving existing results.

This paper describes a family of pseudo-Anosov braids with small dilatation. The smallest dilatations occurring for braids with 3, 4 and 5 strands appear in this family. A pseudo-Anosov braid with 2g+1 strands determines a hyperelliptic mapping class with the same dilatation on a genus-g surface. Penner showed that log…

2009-04-03abs ↗pdf ↗