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

Trend · papers per month

159318476635 · Jun 202019922001200920172026
48 results for bounded multiplicity

New infinite-dimensional representations with bounded multiplicity found for Lie groups.

problem Finding representations with bounded multiplicity for Lie groups.
method Proving existence of infinite-dimensional irreducible representations with bounded multiplicity property.
result Infinite-dimensional irreducible representations with bounded multiplicity found for non-compact semisimple Lie groups.

We prove two explicit bounds for the multiplicities of Steklov eigenvalues σkσ_k on compact surfaces with boundary. One of the bounds depends only on the genus of a surface and the index kk of an eigenvalue, while the other depends as well on the number of boundary components. We also show that on any given smooth Rie…

2012-09-21abs ↗pdf ↗

The paper bounds eigenvalue multiplicities for hyperbolic surfaces using short geodesics.

problem Bounding the multiplicity of Laplacian eigenvalues for hyperbolic surfaces.
method Using the number of short closed geodesics and surface genus.
result Upper bounds on eigenvalue multiplicities, showing sublinear behavior under certain conditions.

We determine the sample complexity of pure exploration bandit problems with multiple good answers. We derive a lower bound using a new game equilibrium argument. We show how continuity and convexity properties of single-answer problems ensures that the Track-and-Stop algorithm has asymptotically optimal sample complexi…

2019-02-09abs ↗pdf ↗

We consider a continuous map f:MNf :M\to N between two manifolds and try to estimate its multiplicity from below, i.e. find a qq-tuple of pairwise distinct points x1,...,xqMx_1,..., x_q\in M such that f(x1)=f(x2)=...=f(xq)f(x_1) = f(x_2) = ... = f(x_q). We show that there are certain characteristic classes of vector bundle fTNTMf^*TN-TM that guarant…

2010-02-03abs ↗pdf ↗

Paper finds efficient OPE estimator for multiple logging policies with minimum variance.

problem Finding optimal importance sampling weights for multiple logging policies with varying variances.
method Established efficiency bound under stratified sampling and proposed an estimator achieving this bound.
result Proposed estimator achieves minimum variance for any instance.

Develops a method for solving optimal stopping problems with multiple exercise rights.

problem Optimal stopping with multiple exercise rights under model uncertainty.
method Pathwise duality approach based on robust martingale dual representation.
result Establishes upper and lower bounds that converge to the true solution.

Let MM be a compact Riemannian manifold not containing any totally geodesic surface. Our main result shows that then the area of any complete surface immersed into MM is bounded by a multiple of its extrinsic curvature energy, i.e. by a multiple of the integral of the squared norm of its second fundamental form.

2019-07-08abs ↗pdf ↗

Klein quartic maximizes the first positive Laplacian eigenvalue's multiplicity to 8.

problem Maximizing the first positive eigenvalue's multiplicity of the Laplacian.
method Analyzing hyperbolic surfaces of genus 3 and 2, proving the Klein quartic's maximality.
result Klein quartic maximizes the first positive Laplacian eigenvalue's multiplicity to 8.

Study on Kähler manifolds shows rigidity of eigenvalues with positive Ricci bound.

problem Optimal rigidity results for eigenvalues on Kähler manifolds with positive Ricci lower bound.
method Established optimal rigidity results for eigenvalues on Kähler manifolds with positive Ricci lower bound.
result Complex projective space is the only Kähler manifold with the largest multiplicity of the first eigenvalue.

Proposes a method to compute valid lower confidence bounds for multiple models selected based on their performance.

problem Model selection and evaluation in machine learning.
method Interprets model selection as a simultaneous inference problem, uses bootstrap tilting and maxT-type multiplicity correction.
result Yields valid lower confidence bounds that are at least as good as standard approaches and reliably reach nominal coverage probability.

We present a data dependent generalization bound for a large class of regularized algorithms which implement structured sparsity constraints. The bound can be applied to standard squared-norm regularization, the Lasso, the group Lasso, some versions of the group Lasso with overlapping groups, multiple kernel learning a…

2011-08-17abs ↗pdf ↗

We derive an upper bound on the local Rademacher complexity of p\ell_p-norm multiple kernel learning, which yields a tighter excess risk bound than global approaches. Previous local approaches aimed at analyzed the case p=1p=1 only while our analysis covers all cases 1p1\leq p\leq\infty, assuming the different feature …

2011-03-03abs ↗pdf ↗

Improved guarantees and multiple-descent curve for data approximations.

problem Improving the effectiveness of small low-rank approximations of large datasets.
method Spectral properties of the data matrix to obtain improved approximation guarantees.
result Revealed a multiple-descent curve in approximation factor as a function of k.

Study phase transitions with prescribed mean curvature in Riemannian manifolds.

problem Understanding phase transitions with prescribed mean curvature in geometric settings.
method Analyzing solutions to inhomogeneous semilinear elliptic PDEs, establishing bounds and asymptotics.
result Established upper and lower bounds for eigenvalues of phase transition problems.

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

Optimal best-arm identification with known number of optimal arms.

problem Identifying the best arm in a multi-armed bandit with multiple optimal arms under fixed confidence.
method Deriving a new information-theoretic lower bound and proposing a modified stopping rule.
result Achieving asymptotic instance-optimality with a new lower bound and new stopping rule.

The paper finds lower bounds for volumes of complex geometric structures.

problem Estimating the volume of complex geometric structures.
method Reduction to a counting problem in the unit tangent bundle, solved using exponential multiple mixing for the geodesic flow.
result First known lower bound for the volume of these manifolds in terms of curve length.

We study a generalization of the multi-armed bandit problem with multiple plays where there is a cost associated with pulling each arm and the agent has a budget at each time that dictates how much she can expect to spend. We derive an asymptotic regret lower bound for any uniformly efficient algorithm in our setting. …

2016-06-30abs ↗pdf ↗

Optimizes profit in targeted marketing across multiple markets with varying marketing expenditures.

problem Maximizing profit in a sequential marketing strategy with multiple markets and varying marketing costs.
method Near-optimal algorithms in an adversarial bandit setting, proving regret bounds for different demand curve types.
result Proved near-optimal regret bounds for the profit-maximization problem in targeted marketing.

In this paper, we study the spectrums of faithful dimension pairs on a closed Finsler manifold and obtain a Gromov type and a Buser type lower bounds for eigenvalues. Furthermore, for the Lusternik-Schnirelmann spectrum, we not only obtain a better lower bound, but also estimate the multiplicity of each eigenvalue.

2018-06-14abs ↗pdf ↗