In this article, we propose the notion of the general p-affine capacity and prove some basic properties for the general p-affine capacity, such as affine invariance and monotonicity. The newly proposed general p-affine capacity is compared with several classical geometric quantities, e.g., the volume, the p-var…
Develops a theory for mth order p-affine capacity for convex bodies containing the origin.
problem Defines and studies the mth order p-affine capacity for convex bodies containing the origin.
method Provides equivalent definitions, proves properties, and establishes inequalities.
result Establishes inequalities comparing to other geometric measures.
Employing the affine normal flow, we prove a stability version of the p-affine isoperimetric inequality for p≥1 in R2 in the class of origin-symmetric convex bodies. That is, if K is an origin-symmetric convex body in R2 such that it has area π and its p-affine perimeter is close en…
New Lp-Steiner quermassintegrals defined from Steiner formula.
problem Defining new Lp-Steiner quermassintegrals. method Analogy to classical Steiner formula, investigating properties in convex bodies.
result Rotation and reflection invariant valuations in convex bodies.
Study on Lp affine surface areas and their inequalities for convex bodies.
problem Understanding weighted Lp affine surface areas in convex bodies. method Investigating valuations, isoperimetric inequalities, and connections to f divergences. result Established isoperimetric inequalities for weighted Lp affine surface areas. We prove an analogue of the classical Steiner formula for the Lp affine surface area of a Minkowski outer parallel body for any real parameters p. We show that the classical Steiner formula and the Steiner formula of Lutwak's dual Brunn Minkowski theory are special cases of this new Steiner formula. This new Stein…
Study on curvature measures in non-Euclidean spaces linked to Euclidean geometry.
problem Investigating curvature measures in spherical, hyperbolic, and de Sitter spaces.
method Establishing a unifying framework for curvature measures in real-analytic spaces of constant curvature.
result Floating bodies and duality in non-Euclidean spaces are connected to curvature measures in Euclidean space.
In this paper, we introduce several mixed Lp geominimal surface areas for multiple convex bodies for all p=−n. Our definitions are motivated from an equivalent formula for the mixed p-affine surface area. Some properties, such as the affine invariance, for these mixed Lp geominimal surface areas are prove…
Study spherical convex bodies using Lp-floating areas and curvature entropy.
problem Analogous isoperimetric inequalities for spherical convex bodies.
method Introduced Lp-floating areas and curvature entropy for spherical convex bodies. result Established isoperimetric inequalities and dual isoperimetric inequalities.
The paper develops inequalities for log-concave functions and related surface areas.
problem Understanding log-concave functions and their inequalities.
method Establishing new inequalities through f-divergences and functional affine surface areas.
result New inequalities on functional affine surface area and bounds for Kullback-Leibler divergence.
In this paper, we introduce the Lp geominimal surface area for all −n=p<1, which extends the classical geominimal surface area (p=1) by Petty and the Lp geominimal surface area by Lutwak (p>1). Our extension of the Lp geominimal surface area is motivated by recent work on the extension of the Lp a…
Given L a convex body, the Lp-Busemann Random Simplex Inequality is closely related to the centroid body ΓpL for p=1 and 2, and only in these cases it can be proved using the Lp-Busemann-Petty centroid inequality. We define a convex body NpL and prove an isoperimetric inequality for (NpL)∘ …
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.
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.
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…
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 rigidity by logarithmic capacity and related functions.
problem Rigidity phenomena in kernel functions and capacities.
method Exploration of Bergman kernel, logarithmic capacity, Green's function, and Euclidean distance/volume.
result Established rigidity theorems by logarithmic capacity.
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.
Upper bounds for Lagrangian capacities of Liouville domains
problem Lagrangian capacity of Liouville domains
method Using S1-equivariant techniques result Extremal Lagrangian torus on the boundary of ellipsoid
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…
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.
Study compares Monge-Ampère capacities on Kähler manifolds.
problem Comparing Monge-Ampère capacities on compact Kähler manifolds.
method Proved all capacities comparable, used Xia's integration by parts formula.
result All Monge-Ampère capacities are comparable.
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.
For any Lie group G, we construct a G-equivariant analogue of symplectic capacities and give examples when G=Tk×Rd−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 G-…
Study proves inequalities for mass-capacity on curved spaces.
problem Proving nonnegativity and positive lower bounds of mass on curved spaces.
method Applying mass-capacity inequalities from \cite{M22} to manifolds with nonnegative scalar curvature.
result Sufficient conditions for nonnegativity and positive lower bounds of mass.
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…
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…
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 …
Estimates for p-capacities on symmetric manifolds.
problem Estimating relative p-capacities on symmetric manifolds. method Rotationally symmetric manifolds and novel volumetric estimates.
result Sharp weak (p,q)-embeddings and precise lower bounds of principal p-frequencies. The study evaluates memory and capacity of graph embedding methods.
problem Assessing the memory and capacity of graph embedding methods.
method Not specified in the abstract provided.
result Not specified in the abstract provided.
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…
Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices, have recently been proposed as a means to avoid these issues. However, in previous …
Study shows how activation functions impact the storage capacity of treelike neural networks.
problem Understanding the role of activation functions in neural network expressive power.
method Analysis of treelike two-layer networks with various activation functions in the infinite-width limit.
result Activation functions affect storage capacity and robustness, with nonlinearity increasing capacity and decreasing robustness.
Enhances CNN feature extractors' separation capacity analysis.
problem Understanding the separation capacity of CNNs.
method Extending Cover's function-counting theory, analyzing scattering networks.
result Identifies factors affecting scattering networks' separation capacity.
Existence and uniqueness of the solution to the discrete Lp Minkowski problem for p-capacity are proved when p≥1 and 1<p<n. For general Lp Minkowski problem for p-capacity, existence and uniqueness of the solution are given when p≥1 and 1<p≤2. These r…