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

Trend · papers per month

24487195 · May 202619922001200920172026
48 results for conformal capacity

Study shows mass-capacity inequality for specific geometric manifolds.

problem Establishing mass-capacity inequality for certain geometric manifolds.
method Using conformally flat manifolds with nonnegative scalar curvature.
result Equality implies harmonically conformal to a specific subset of Euclidean space.

The electric capacity of a conductor in the 3-dimensional Euclidean space R3R^3 is defined as a ratio of a given positive charge on the conductor to the value of potential on the surface. This definition of the capacity is independent of the given charge. The capacity of a set as a mathematical notion was defined firs…

2006-08-20abs ↗pdf ↗

Here, the concept of electric capacity on Finsler spaces is introduced and the fundamental conformal invariant property is proved, i.e. the capacity of a compact set on a connected non-compact Finsler manifold is conformal invariant. This work enables mathematicians and theoretical physicists to become more familiar wi…

2009-02-03abs ↗pdf ↗

In this paper we prove a mass-capacity inequality and a volumetric Penrose inequality for conformally flat manifolds, in arbitrary dimensions. As a by-product of the proofs, Pólya-Szegö and Aleksandrov-Fenchel inequalities for mean-convex Euclidean domains are obtained. For each inequality, the case of equality is char…

2011-07-07abs ↗pdf ↗

This paper addresses the so-called conformal capacities in Rn\mathbb R^n, n3n\ge 3, through comparing three existing definitions (due to Betsakos, Colesanti-Cuoghi, Anderson-Vamananmurthy-Fuglede respectively) and studying their associated iso-capacitary inequalities with connection to half-diameter, mean-width, mean-c…

2013-09-14abs ↗pdf ↗

In this paper we study asymptotic behavior of nn-superharmonic functions at isolated singularity using the Wolff potential and nn-capacity estimates in nonlinear potential theory. Our results are inspired by and extend those of Arsove-Huber and Taliaferro in 2 dimensions. To study nn-superharmonic functions we use a…

2018-10-24abs ↗pdf ↗

We prove an optimal systolic inequality for nonpositively curved Dyck's surfaces. The extremal surface is flat with eight conical singularities, six of angle theta and two of angle 9pi - theta, for a suitable theta with cos(theta) in Q(sqrt{19}). Relying on some delicate capacity estimates, we also show that the extrem…

2012-05-01abs ↗pdf ↗

An intrinsic definition in terms of conformal capacity is proposed for the conformal type of a Carnot--Carathéodory space (parabolic or hyperbolic). Geometric criteria of conformal type are presented. They are closely related to the asymptotic geometry of the space at infinity and expressed in terms of the isoperimetri…

1996-09-17abs ↗pdf ↗

We derive a positive mass theorem for asymptotically flat manifolds with boundary whose mean curvature satisfies a sharp estimate involving the conformal Green's function. The theorem also holds if the conformal Green's function is replaced by the standard Green's function for the Laplacian operator. As an application,…

2018-12-10abs ↗pdf ↗

Generalizes conformal prediction to multiple learnable parameters for efficient prediction sets.

problem Learning valid and efficient prediction sets with low-capacity function classes.
method Constrained empirical risk minimization (ERM) with gradient-based optimization of differentiable surrogate losses and Lagrangians.
result Achieves approximate valid population coverage and near-optimal efficiency within class.

New methods prove non-squeezing in locally conformal symplectic geometry.

problem Non-squeezing theorem in locally conformal symplectic geometry.
method Generating functions and spectral selectors for lcs Hamiltonian diffeomorphisms.
result Proves a non-squeezing theorem in S1imesR2nimesS1S^1 imes \mathbb{R}^{2n} imes S^1.

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.

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 ↗

For any Lie group GG, we construct a GG-equivariant analogue of symplectic capacities and give examples when G=Tk×RdkG = \mathbb{T}^k\times\mathbb{R}^{d-k}, in which case the capacity is an invariant of integrable systems. Then we study the continuity of these capacities, using the natural topologies on the symplectic GG-…

2015-11-14abs ↗pdf ↗

Study online learning with delays and capacity constraints, achieving optimal regret bounds.

problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.

In this paper, we investigate the common scenario where every candidate item for recommendation is characterized by a maximum capacity, i.e., number of seats in a Point-of-Interest (POI) or size of an item's inventory. Despite the prevalence of the task of recommending items under capacity constraints in a variety of s…

2017-01-18abs ↗pdf ↗

Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.

problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.

Inspired by the work of G. Lu on pseudo symplectic capacities we obtain several results on the Gromov width and the Hofer--Zehnder capacity of Hermitian symmetric spaces of compact type. Our results and proofs extend those obtained by Lu for complex Grassmannians to Hermitian symmetric spaces of compact type. We also c…

2013-02-08abs ↗pdf ↗

BestChanID identifies the channel with maximal capacity using training sequences.

problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.

Capacity analysis has been recently introduced as a way to analyze how linear models distribute their modelling capacity across the input space. In this paper, we extend the notion of capacity allocation to the case of neural networks with non-linear layers. We show that under some hypotheses the problem is equivalent …

2019-02-22abs ↗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 address the following question, given a face representation, how many identities can it resolve? In other words, what is the capacity of the face representation? A scientific basis for estimating the capacity of a given face representation will not only benefit the evaluation and comparison of differen…

2017-09-29abs ↗pdf ↗