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

15304560 · May 202619922001200920172026
48 results for ball capacity

Symplectic capacities of domains near balls are well-defined, but not for all C1C^1-close domains.

problem Understanding symplectic capacities of domains near balls and their stability.
method General theorem about contact forms close to Zoll ones, spectral invariants for contact forms.
result Existence of minimizing geodesics in the space of contact forms.

Previously, Cristofaro-Gardiner, Hutchings and Ramos have proved that embedded contact homology (ECH) capacities can recover the volume of a contact 3-manifod in their paper "the asymptotics of ECH capacities" . There were two main steps to proving this theorem: The first step used an estimate for the energy of min-max…

2018-01-08abs ↗pdf ↗

Study the relative volume function on AH manifolds and its applications.

problem Characterize the height of geodesic defining functions and capacity of balls.
method Define and analyze the relative volume function, proving its boundedness and regularity.
result Uniformly bounded relative volume function at infinity, bound dependent only on dimension.

We define a capacity which measures the size of Weinstein tubular neighbourhoods of Lagrangian submanifolds. In symplectic vector spaces this leads to bounds on the codisc radius for any closed Lagrangian submanifold in terms of Viterbo's isoperimetric inequality. Moreover, we prove a generalization of Gromov's packing…

2012-10-08abs ↗pdf ↗

Defines a distance function on a manifold using symplectic embeddings and recovers the metric.

problem Recovering a Riemannian metric from symplectic embeddings in cotangent bundles.
method Defines a distance-like function ρWρ_W using symplectic embeddings and recovers the metric when WW is the unit disc-cotangent bundle.
result The distance function ρWρ_W recovers the Riemannian metric when WW is the unit disc-cotangent bundle.

We provide a rigorous mathematical treatment to the crowding issue in data visualization when high dimensional data sets are projected down to low dimensions for visualization. By properly adjusting the capacity of high dimensional balls, our method makes right enough room to prepare for the embedding. A key component …

2019-09-29abs ↗pdf ↗

Study semicontinuity of capacity in non-smooth spaces using intrinsic flat convergence.

problem Investigate semicontinuity of capacity in non-smooth spaces.
method Analyze sequences of local integral current spaces converging in the pointed Sormani-Wenger intrinsic flat sense.
result Prove upper semicontinuity of capacity for balls and Lipschitz sublevel sets under volume-preserving convergence.

In this paper, we define a new capacity which allows us to control the behaviour of the Dirichlet spectrum of a compact Riemannian manifold with boundary, with "small" subsets (which may intersect the boundary) removed. This result generalizes a classical result of Rauch and Taylor ("the crushed ice theorem"). In the s…

2005-04-08abs ↗pdf ↗

We use the criteria of Lalonde and McDuff to determine a new class of examples of length minimizing paths in the group Ham(M)Ham(M). For a compact symplectic manifold MM of dimension two or four, we show that a path in Ham(M)Ham(M), generated by an autonomous Hamiltonian and starting at the identity, which induces no non-cons…

1999-05-18abs ↗pdf ↗

New learning rates derived for Tikhonov-regularized problems without kernel assumptions.

problem Learning rates for Tikhonov-regularized learning problems.
method Minimax adaptive rates derived using Fourier isocapacitary condition and interpolation theory.
result Derivation of minimax adaptive rates without requiring kernel assumptions.

We completely solve the symplectic packing problem with equally sized balls for any rational, ruled, symplectic 4-manifolds. We give explicit formulae for the packing numbers, the generalized Gromov widths, the stability numbers, and the corresponding obstructing exceptional classes. As a corollary, we give explicit va…

2011-04-18abs ↗pdf ↗

Deep dynamic generative models are developed to learn sequential dependencies in time-series data. The multi-layered model is designed by constructing a hierarchy of temporal sigmoid belief networks (TSBNs), defined as a sequential stack of sigmoid belief networks (SBNs). Each SBN has a contextual hidden state, inherit…

2015-09-23abs ↗pdf ↗

Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this propert…

2017-05-22abs ↗pdf ↗

We study various capacities on compact Kähler manifolds which generalize the Bedford-Taylor Monge-Ampère capacity. We then use these capacities to study the existence and the regularity of solutions of complex Monge-Ampère equations.

2014-02-11abs ↗pdf ↗

Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.

problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.

CapOptix uses options theory to price capacity in electricity markets.

problem Traditional capacity market designs fail to account for risk and price shocks.
method Interprets capacity commitments as reliability options and uses Markov Regime Switching Process.
result CapOptix provides more accurate pricing of capacity premia compared to existing mechanisms.

In this article, we propose the notion of the general pp-affine capacity and prove some basic properties for the general pp-affine capacity, such as affine invariance and monotonicity. The newly proposed general pp-affine capacity is compared with several classical geometric quantities, e.g., the volume, the pp-var…

2017-05-21abs ↗pdf ↗

While symplectic manifolds have no local invariants, they do admit many global numerical invariants. Prominent among them are the so-called symplectic capacities. Different capacities are defined in different ways, and so relations between capacities often lead to surprising relations between different aspects of sympl…

2005-06-10abs ↗pdf ↗

Study excess capacity in neural networks using Rademacher complexity.

problem Understanding how much capacity deep networks have beyond what's needed for classification.
method Unified Rademacher complexity bounds for function composition and convolutional layers, considering Lipschitz constants and initialization norms.
result There is substantial excess capacity per task, and capacity can be kept similar across different tasks.

Study binary perceptrons' capacity using random duality theory.

problem Characterize the capacity of binary perceptrons with general thresholds.
method Utilized fully lifted random duality theory (fl RDT) to characterize the capacity.
result Characterizations match replica symmetry breaking predictions and uncover the capacity for zero-threshold scenario.

Study capacity constraints in continual learning with a simple model.

problem Understanding optimal resource allocation for agents with limited memory and compute resources.
method Analyzes a capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem and demonstrates optimal capacity allocation strategies.
result Derives a solution to the capacity-constrained LQG sequential prediction problem and shows how to optimally allocate capacity across sub-problems in the steady state.

New complete panel dataset for LMICs helps analyze innovation and development.

problem Lack of complete data for empirical analyses in LMICs.
method Predictive Mean Matching multiple imputation technique.
result Created a large dataset of 47 variables for 82 LMICs from 2005-2019.

New geometric quantities help classify manifolds and relate to entropy.

problem Classifying Riemannian manifolds using geometric quantities.
method Introducing and analyzing asymptotic geometric quantities like p-capacity, eigenvalues, and Maz'ya constant.
result Geometric quantities coincide with entropy in specific conditions, characterizing manifolds.

Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.

problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.

Proves local maximizers for higher Ekeland-Hofer capacities in 4D star-shaped domains.

problem Finding local maximizers for higher Ekeland-Hofer capacities in specific domains.
method Analogous to 4D local Viterbo conjecture, proving maximizers for rational ellipsoids.
result Local maximizers of the k-th Ekeland-Hofer capacities are symplectomorphic to rational ellipsoids.

Derives an empirical capacity model for self-attention neural networks.

problem Theoretical capacity of large transformer models is not fully utilized by current optimization algorithms.
method Analyzes memory capacity of transformers using synthetic training data and common training algorithms.
result Derives an empirical capacity model (ECM) for a generic transformer.

Improves online learning algorithms for functional models with capacity assumptions.

problem Convergence rates of online stochastic gradient descent algorithms for functional linear models.
method Characterizations of slope function regularity, kernel space capacity, and sampling process covariance operator.
result Capacity assumptions can alleviate saturation of convergence rates as function regularity increases.

We introduce the concept of pseudo symplectic capacities which is a mild generalization of that of symplectic capacities. As a generalization of the Hofer-Zehnder capacity we construct a Hofer-Zehnder type pseudo symplectic capacity and estimate it in terms of Gromov-Witten invariants. The (pseudo) symplectic capacitie…

2001-03-28abs ↗pdf ↗

Study relates symplectic homology capacity to periodic orbits in Liouville domains.

problem Relating symplectic homology capacity to periodic orbits in Liouville domains.
method Uses positive symplectic homology and Hofer-Zehnder capacity to establish bounds and existence of periodic points.
result Non-zero positive symplectic homology implies finite upper bound for Hofer-Zehnder capacity relative to skeleton and Hamiltonian diffeomorphisms.

Learning capacity measures model complexity, correlating with test loss and sample size.

problem Understanding model complexity and its relation to test performance.
method Formal correspondence between thermodynamics and inference; learning capacity as a measure of effective dimensionality.
result Learning capacity correlates with test loss and is a small fraction of model parameters.

Generalizes memory and forecasting capacities for nonlinear recurrent networks with dependent inputs.

problem Understanding memory and forecasting capabilities in networks with dependent inputs.
method Formulated bounds for memory and forecasting capacities in terms of network size and input properties.
result Proved that memory capacity for linear recurrent networks with independent inputs is given by the rank of the controllability matrix.

This paper is devoted to a geometric-measure-theoretic study of the brand new affine BV-capacity which is essentially different from the classic BV-capacity in dimension greater than one.

2015-10-27abs ↗pdf ↗