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.

169,051 papers · 148 categories

Trend · papers per month

2.8%5.6%8.3%11.1% · Feb 202619922001200920182026
48 results for tight priors

TzK model learns tight conditional priors using side information.

problem Learning tight conditional priors using side information.
method TzK is a conditional probability flow-based model that exploits attributes to learn tight conditional priors around target observations. It trains via approximated ML and supports supervised, unsupervised, and semi-supervised learning.
result TzK produces efficient and stable approximations of arbitrary data distributions, comparable to state-of-the-art models.

The paper explores the limits of tight PAC-Bayes bounds for cheap models in robust statistics.

problem The challenge of obtaining meaningful bounds on the error of learning algorithms without prior assumptions.
method Investigates tight PAC-Bayes bounds for robust models with minimal cost.
result Demonstrates the limits of obtaining tight PAC-Bayes bounds for cheap models.

We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance, extending classical Bernstein inequalities, and sharpening and simplifying prior wor…

2015-06-22abs ↗pdf ↗

Prediction intervals are a valuable way of quantifying uncertainty in regression problems. Good prediction intervals should be both correct, containing the actual value between the lower and upper bound at least a target percentage of the time; and tight, having a small mean width of the bounds. Many prior techniques f…

2018-06-28abs ↗pdf ↗

Paper tackles infinite action linear bandits with tight regret bounds.

problem Linear contextual bandit with infinite action sets.
method Proves a regret upper bound of O(d2TlogT)imesextpoly(loglogT)O(\sqrt{d^2T\log T}) imes ext{poly}(\log\log T).
result Upper bound matches previous lower bound of Ω(d2TlogT)Ω(\sqrt{d^2 T\log T}) up to iterated logarithmic terms.

Improved statistical efficiency of Thompson Sampling for combinatorial semi-bandits.

problem Efficiency of policies in stochastic combinatorial multi-armed bandits with semi-bandit feedback.
method Analysis of Combinatorial Thompson Sampling (CTS) using Beta and Gaussian priors for mutually independent and multivariate sub-Gaussian outcomes.
result CTS provides an efficient policy with optimal asymptotic regret for both mutually independent and multivariate sub-Gaussian outcomes.

Unified framework for differentiable graph partitioning with probabilistic cuts.

problem Lack of general guarantees and principled gradients in prior probabilistic relaxations of graph cuts.
method Unified probabilistic framework covering a wide class of cuts, including Normalized Cut, with tight analytic upper bounds.
result Rigorous, numerically stable foundation for scalable, differentiable graph partitioning.

Study on maximizing submodular functions with limited updates, achieving tight bounds and poly-time algorithms.

problem Online submodular maximization with constant recourse.
method Information-theoretic bounds and poly-time randomized algorithms.
result Achieved tight bounds of 2/3 and 3/4 for general and coverage functions, respectively, with a 0.51 approximation.

Researchers estimate optimal PAC-Bayes bounds using Hamiltonian Monte Carlo.

problem Estimating tight PAC-Bayes bounds with restricted posterior families.
method Sampling from optimal Gibbs posterior using Hamiltonian Monte Carlo, estimating KL divergence, and proposing high-probability bounds.
result Significant tightness gaps in PAC-Bayes bounds, up to 5-6% in some cases.

We consider the problem of Bayesian optimization (BO) in one dimension, under a Gaussian process prior and Gaussian sampling noise. We provide a theoretical analysis showing that, under fairly mild technical assumptions on the kernel, the best possible cumulative regret up to time TT behaves as Ω(T)Ω(\sqrt{T}) and $O(\s…

2018-05-30abs ↗pdf ↗

DSIVI improves variational autoencoders by optimizing a proper lower bound on ELBO.

problem Improving variational autoencoders with implicit priors.
method Introducing DSIVI, a method that optimizes a proper lower bound on ELBO for models with semi-implicit priors and posteriors.
result DSIVI improves the performance of VampPrior, a state-of-the-art prior for variational autoencoders.

DABS uses a policy network to select experiments in high-dimensional design spaces.

problem Adaptive factorial screening in high-dimensional discrete design spaces.
method DABS learns a policy network offline to sequentially select experiments, incorporating sparsity and interactions via a spike-and-slab prior.
result DABS achieves superior accuracy and scalability over classical and Bayesian baselines under tight experimental budgets.

Bayesian algorithms perform well even with misspecified priors, especially in meta-learning.

problem Performance degradation of Bayesian algorithms with misspecified priors.
method Thompson sampling and meta-learning analysis with misspecified priors.
result Thompson sampling's performance degrades gracefully with misspecification, with a bound of ildeO(H2ε) ilde{\mathcal{O}}(H^2 ε).

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known tight triangulated manifolds are stacked. It is known that locally stacked tight t…

2015-06-01abs ↗pdf ↗

Tight geodesics were introduced by Masur-Minsky in [17]. They and their hierarchies have been a powerful tool in the study of the curve complex, mapping class groups, Teichmüller spaces, and hyperbolic 3-manifolds. In the same paper, they showed that there are at least one and at most finitely many tight geodesics betw…

2017-03-30abs ↗pdf ↗

We introduce the notion of tight homomorphism into a locally compact group with nonvanishing bounded cohomology and study these homomorphisms in detail when the target is a Lie group of Hermitian type. Tight homomorphisms between Lie groups of Hermitian type give rise to tight totally geodesic maps of Hermitian symmetr…

2007-10-30abs ↗pdf ↗

Study tight contact structures on figure-eight knot surgeries.

problem Classify tight contact structures on surgeries of figure-eight knot.
method Analyzes surgeries on figure-eight knot, determining tightness, symplectic fillability, and universality.
result First classification of tight contact structures on surgeries of figure-eight knot.

Tight maps was introduced along tight homomorphisms by Burger, Iozzi and Wienhard with aims towards maximal representations. In this paper we classify tight maps into classical Hermitian symmetric spaces and give a partial result for the exceptional spaces.

2012-06-20abs ↗pdf ↗

Classifies tight contact structures on surgeries of the Whitehead link.

problem Classifying tight contact structures on surgeries of the Whitehead link.
method Analyzes various surgeries on the Whitehead link to classify tight contact structures.
result Determines tight contact structures, Stein fillability, and virtually overtwisted properties.

In this paper, we derive Hybrid, Bayesian and Marginalized Cramér-Rao lower bounds (HCRB, BCRB and MCRB) for the single and multiple measurement vector Sparse Bayesian Learning (SBL) problem of estimating compressible vectors and their prior distribution parameters. We assume the unknown vector to be drawn from a compr…

2012-02-06abs ↗pdf ↗

In \cite{confol} Y. Eliashberg and W. Thurston gave a definition of tight confoliations. We give an example of a tight confoliation ξξ on T3T^3 violating the Thurston-Bennequin inequalities. This answers a question from \cite{confol} negatively. Although the tightness of a confoliation does not imply the Thurston-Benn…

2009-01-08abs ↗pdf ↗

In this paper we develop a method for studying tight contact structures on lens spaces. We then derive uniqueness and non-existence statements for tight contact structures with certain (half) Euler classes on lens spaces. We also prove that any lens space admits only finitely many tight contact structures.

1998-12-10abs ↗pdf ↗

Classifies real tight contact structures on lens spaces and solid tori.

problem Classifying real tight contact structures on specific 3-manifolds.
method Equivariant contact isotopy, real open book decompositions, and isolated real algebraic surface singularities.
result Unique real tight structures on S3S^3 and RP3\mathbb{R}P^3, at most one on L(p,±1)L(p,\pm 1), and bounds on the count.

New proof of Giroux Correspondence for tight contact 3-manifolds.

problem Proving the Giroux Correspondence for tight contact 3-manifolds.
method Introducing tight Heegaard splittings, using refinement process, and translating moves between splittings to moves between open books.
result Proves the tight Giroux Correspondence for contact 3-manifolds.

We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered. Since a positive L-space knot is tight fibered, a non-trivial band sum never yie…

2015-09-01abs ↗pdf ↗

New lower bounds for private covariance estimation of Gaussian distributions are proven.

problem Proving tight lower bounds for private estimation tasks under differential privacy.
method Generalized fingerprinting method for exponential families and private Assouad method.
result Tight lower bounds for private covariance estimation in Frobenius and spectral norms.

We introduce and systematically study the concept of a growth tight action. This generalizes growth tightness for word metrics as initiated by Grigorchuk and de la Harpe. Given a finitely generated, non-elementary group GG acting on a GG--space X\mathcal{X}, we prove that if GG contains a strongly contracting eleme…

2014-01-02abs ↗pdf ↗

In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a set- function de ned on the support of the unknown parameter vector which represents prior knowledge on supports, and (b) regularized in Lp-n…

2012-05-06abs ↗pdf ↗

Study non-fibered links' relation to tight contact structures.

problem Understanding non-fibered links and their tight contact structures.
method Analyze non-fibered links with induced partial open books and contact structures.
result Strongly quasipositive non-fibered links induce tight contact structures, but the converse is not always true.