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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for discrete subset

Rigidity theorem for discrete metric spaces embedded in Riemannian surfaces.

problem Understanding the rigidity of discrete metric spaces embedded in Riemannian surfaces.
method Proving that certain discrete metric spaces are rigidly embedded in the Euclidean plane or other Riemannian surfaces.
result Riemannian embeddings of certain discrete metric spaces are rigid, meaning they cannot be deformed without changing distances.

PixelCNN models can achieve state-of-the-art results on CIFAR-10 with exact likelihood computation.

problem Dequantization gap in modeling discrete data like images.
method Introducing subset flows to allow exact computation of likelihoods for discrete data.
result PixelCNN models trained with exact likelihood computation achieve state-of-the-art results on CIFAR-10.

Abstract result on correlations of pairs in exponentially growing discrete subsets.

problem Pair correlations in exponentially growing discrete subsets with weight functions.
method Proved abstract result on correlations of pairs of elements in an exponentially growing discrete subset with a weight function.
result Distribution function of unscaled differences is tδ2ett\mapsto\fracδ2\,e^{-|t|}, and pair correlation exhibits Poissonian behavior under certain conditions.

The group of C1\mathcal C^1-diffeomorphisms of any sparse Cantor subset of a manifold is countable and discrete (possibly trivial). Thompson's groups come out of this construction when we consider central ternary Cantor subsets of an interval. Brin's higher dimensional generalizations nVnV of Thompson's group VV arise…

2014-11-18abs ↗pdf ↗

Proves critical exponent for ΘΘ-positive representations in discrete subgroups.

problem Determining the critical exponent for ΘΘ-positive representations.
method Analyzes discrete subgroups ΓPSL(2,R)Γ\subset \mathsf{PSL}(2,\mathbb{R}) and their geometric properties.
result Equality of critical exponent holds if and only if ΓΓ is a lattice for geometrically finite ΓΓ.

Universal inequalities for Laplacian eigenvalues on discrete groups.

problem Proving inequalities for Laplacian eigenvalues on discrete groups.
method Analyzing Laplacian eigenvalues with Dirichlet boundary conditions on subsets of discrete groups.
result Yang-type universal inequalities for Cayley graphs of amenable groups and the d-regular tree.

This paper provides an explicit form for symmetric differentials and their corresponding holomorphic functions.

problem Understanding the correspondence between symmetric differentials and L2L^2 holomorphic functions on quotient spaces.
method Explicit description of the correspondence between symmetric differentials and weighted L2L^2-holomorphic functions.
result Derivation of several applications based on the explicit form of the correspondence.

Compact hyperbolic complex manifolds are rigid under deformation.

problem Studying the deformation behavior of compact hyperbolic complex manifolds.
method Analyzing smooth families of compact complex manifolds over the unit disk and compact Riemann surfaces.
result The HH-locus is either at most a discrete subset or the whole domain, depending on the family structure.

Log-concavity proven for multinomial likelihoods under specific constraints.

problem Log-concavity of multinomial likelihoods under interval censoring constraints.
method Proved log-concavity by showing M-convex subsets of the discrete simplex.
result Likelihood function is completely log-concave.

No exact G₂-structures on compact Lie group quotients.

problem Existence of exact G₂-structures on compact quotients of Lie groups.
method Analyzing compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups.
result Compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups do not admit exact G₂-structures induced by left-invariant ones.

Finite graphs with specific curvature have limited harmonic functions and ends.

problem Graphs with nonnegative curvature outside a finite subset.
method Introducing discrete Gromov-Hausdorff convergence to study bounded harmonic functions.
result The space of bounded harmonic functions is finite dimensional, and the number of non-parabolic ends is finite.

We introduce and study a new class of representations of surface groups into Lie groups of Hermitian type, called {\em weakly maximal} representations. We prove that weakly maximal representations are discrete and injective and we describe the structure of the Zariski closure of their image. Furthermore we prove that t…

2013-05-12abs ↗pdf ↗

Proposes a neural framework to select subsets efficiently across different models.

problem Lack of generalizability in subset selection methods for unseen architectures.
method Introduces a trainable subset selection framework, SubSelNet, that uses attention-based neural gadgets and subset samplers.
result SubSelNet generalizes across architectures and outperforms existing methods.

Determinantal point processes (DPPs) are probabilistic models for repulsion. When used to represent the occurrence of random subsets of a finite base set, DPPs allow to model global negative associations in a mathematically elegant and direct way. Discrete DPPs have become popular and computationally tractable models f…

2018-10-04abs ↗pdf ↗

New DKPP family controls positive and negative dependence in random subsets.

problem Challenges in seamlessly bridging probabilistic models for positive and negative dependence.
method Introduced DKPP family and developed computational methods for probabilistic operations and inference.
result Controllability of positive and negative dependence demonstrated through numerical experiments.

Locally-verifiable conditions ensure exactness of spline discrete de Rham complex.

problem Ensuring cohomological equivalence of spline discrete complex to continuous de Rham complex.
method Theoretical analysis and locally-verifiable sufficient conditions for exactness.
result Locally-verifiable conditions guarantee exactness of hierarchical B-spline discrete de Rham complex.

Efficiently aggregating data from different sources is a challenging problem, particularly when samples from each source are distributed differently. These differences can be inherent to the inference task or present for other reasons: sensors in a sensor network may be placed far apart, affecting their individual meas…

2017-05-21abs ↗pdf ↗

New algorithm approximates maximum of certain distributions on subsets.

problem Finding maximum of distributions on subsets.
method Connection between sampling and optimization via exchange inequalities and local random walks.
result Simple nearly-optimal approximation algorithm for MAP inference.

In this paper we get an explicit lower bound for the radius of a Bergman ball contained in the Dirichlet fundamental polyhedron of a torsion-free discrete group GPU(n,1)G\subset PU(n,1) acting on complex hyperbolic space. Consequently the volume of all complex hyperbolic n-manifolds is bounded below by the volume of this bal…

2012-03-16abs ↗pdf ↗

The current article stems from our study on the asymptotic behavior of holomorphic isometric embeddings of the Poincaré disk into bounded symmetric domains. As a first result we prove that any holomorphic curve exiting the boundary of a bounded symmetric domain ΩΩ must necessarily be asymptotically totally geodesic. A…

2018-07-19abs ↗pdf ↗

The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of dd-dimensional cubes in Rd\mathbb R^d is (3d+1)/2\lfloor(3d+1)/2\rfloor.

2014-12-20abs ↗pdf ↗

This paper considers extractive summarisation in a comparative setting: given two or more document groups (e.g., separated by publication time), the goal is to select a small number of documents that are representative of each group, and also maximally distinguishable from other groups. We formulate a set of new object…

2018-12-06abs ↗pdf ↗

This paper is a continuation of the paper F. A. Arias and M. Malakhaltsev "A generalization of the Gauss-Bonnet and Hopf-Poincaré theorems", ArXiv:1510.01395 [MathDG] 5 Oct 2015. Let π:EMπ: E \to M be a locally trivial fiber bundle over a two-dimensional manifold MM, and ΣMΣ\subset M be a discrete subset. A subset $Q \s…

2016-10-09abs ↗pdf ↗

Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of…

2013-11-12abs ↗pdf ↗

Exponential localization of eigensections for Bochner-Schrödinger operator.

problem Understanding spectral properties of Bochner-Schrödinger operator on high tensor powers of Hermitian line bundles.
method Approximation of operator by model Schrödinger operator with constant magnetic field, analysis of spectrum.
result Spectrum of Bochner-Schrödinger operator in gaps is discrete and eigensections decay exponentially.

Hybrid RL method optimizes trading by balancing continuous and discrete actions.

problem Optimal execution in algorithmic trading with continuous-discrete action space.
method Combines continuous and discrete RL agents for better trading decisions.
result Significantly outperforms existing methods in trading efficiency and stability.

We investigate the systematic mechanism for designing fast mixing Markov chain Monte Carlo algorithms to sample from discrete point processes under the Dobrushin uniqueness condition for Gibbs measures. Discrete point processes are defined as probability distributions μ(S)exp(βf(S))μ(S)\propto \exp(βf(S)) over all subsets $S\in 2^…

2015-06-06abs ↗pdf ↗

We will discuss fundamental domains for actions of discrete groups on the 3-dimensional Einstein Universe. These will be bounded by crooked surfaces, which are conformal compactifications of surfaces that arise in the construction of Margulis spacetimes. We will show that there exist pairwise disjoint crooked surfaces …

2013-07-24abs ↗pdf ↗

We consider the cohomology group H1(Γ,ρ)H^1(Γ, ρ) of a discrete subgroup ΓG=SU(n,1)Γ\subset G=SU(n, 1) and the symmetric tensor representation ρρ on Sm(Cn+1)S^m(\mathbb C^{n+1}). We give an elementary proof of the Eichler-Shimura isomorphism that harmonic forms H1(Γ\G/K,ρ)H^1(Γ\backslash G/K, ρ) are (0,1)(0, 1)-forms for the automorphic holomorphic…

2013-03-01abs ↗pdf ↗

This paper tackles convex-submodular minimax problems in mixed continuous-discrete domains.

problem Convex-submodular minimax problems in mixed continuous-discrete domains.
method Introduces new notions of optimality and proposes iterative algorithms combining discrete and continuous optimization.
result Characterizes convergence rates, computational complexity, and quality of solutions for convex and monotone-submodular minimax problems.