New method uses relative capacities of geodesic balls to determine scalar curvature.
problem Determining scalar curvature from geodesic ball volumes.
method Using relative capacities of concentric small geodesic balls.
result Scalar curvature is determined by relative capacities of geodesic balls.
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.
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.
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 main theme of this paper is a relative version of the almost existence theorem for periodic orbits of autonomous Hamiltonian systems. We show that almost all low levels of a function on a geometrically bounded symplectically aspherical manifold carry contractible periodic orbits of the Hamiltonian flow, provided th…
We study the computational capacity of a model neuron, the Tempotron, which classifies sequences of spikes by linear-threshold operations. We use statistical mechanics and extreme value theory to derive the capacity of the system in random classification tasks. In contrast to its static analog, the Perceptron, the Temp…
New mass definition linked to ADM mass for general metrics.
problem Defining mass for metrics with low regularity.
method Using isocapacitary inequality to define total mass.
result Inequality between new mass and ADM mass proved.
The paper proposes a probabilistic autoencoder for discovering causal directions between variables.
problem Finding the causal direction between two associated variables.
method Building an autoencoder of the joint distribution and maximizing its estimation capacity relative to marginal distributions.
result The higher estimation capacity is consistent with the unconstrained choice of a distribution representing the cause, while the lower capacity reflects the constraints imposed by the mechanism on the distribution of the effect.
In this paper, we propose the nonlinearity generation method to speed up and stabilize the training of deep convolutional neural networks. The proposed method modifies a family of activation functions as nonlinearity generators (NGs). NGs make the activation functions linear symmetric for their inputs to lower model ca…
Sharp estimates for p-capacity on manifolds with Ricci curvature bounds.
problem Estimating p-capacity on manifolds with Ricci curvature constraints.
method Sharp comparison inequalities, warped-product model ends, and scale-invariant quantities.
result Characterization of equality cases and optimal ranges for normalization parameters.
Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …
We investigate under and overfitting in Generative Adversarial Networks (GANs), using discriminators unseen by the generator to measure generalization. We find that the model capacity of the discriminator has a significant effect on the generator's model quality, and that the generator's poor performance coincides with…
New analysis tightens memory capacity of Hopfield models using spherical codes.
problem Optimizing memory capacity in modern Hopfield models and Kernelized Hopfield Models.
method Connecting Hopfield models to spherical codes in information theory, establishing an optimal capacity bound and a sub-linear algorithm.
result First tight and optimal asymptotic memory capacity for modern Hopfield models, matching known lower bounds.
Maximizes capacity of extensions with fixed boundary data.
problem Maximizing the capacity of extensions with nonnegative scalar curvature.
method Using the method of Lagrange multipliers on the constraint space of scalar-flat extensions.
result Derives variational condition for maximal capacity extensions and proves they have constant scalar curvature.
The paper defines capacities for minimal graphs over manifolds and proves the half-space property.
problem Characterizing minimal graphs and their properties over manifolds.
method Defining capacities using relative volume, studying solutions of bounded variation, and analyzing boundary behavior.
result Proves the half-space property for M-parabolic manifolds. The study calculates the injectivity capacity of ReLU networks using a novel mathematical approach.
problem Determining the injectivity capacity of ReLU networks layers.
method Employing fully lifted random duality theory (fl RDT) to handle the ℓ0 spherical perceptron and implicitly the ReLU layers injectivity. result The lifting mechanism converges remarkably fast with relative corrections not exceeding 0.1%.
Wide hidden layer TCM nets capacity analyzed using RDT and fl RDT.
problem Capacity analysis of wide hidden layer TCM nets.
method Employed Fully Lifted Random Duality Theory (fl RDT) for capacity characterization.
result Explicit, closed form capacity characterizations for a generic class of hidden layer activations.
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…
The paper connects mass, harmonic functions, and capacity in asymptotically flat 3-manifolds.
problem Connections among ADM mass, harmonic functions, and capacity in asymptotically flat 3-manifolds.
method New formulae for ADM mass via harmonic functions, monotone quantities, and geometric inequalities.
result The mass-to-capacity ratio is bounded below by 1 - sqrt(normalized Willmore functional of the boundary).
Paper introduces a complete metric topology for low energy spaces.
problem Defining a topology for low energy spaces with prescribed singularity.
method Introduces a completely metrizable topology stronger than capacity convergence.
result Low energy spaces have a natural completely metrizable topology.
Deep neural networks with more parameters and FLOPs have higher capacity and generalize better to diverse domains. But to be deployed on edge devices, the model's complexity has to be constrained due to limited compute resource. In this work, we propose a method to improve the model capacity without increasing inferenc…
First we restate the definition of a Zero Area Singularity, recently introduced by H. Bray. We then consider several definitions of mass for these singularities. We use the Inverse Mean Curvature Flow to prove some new results about the mass of a singularity, the ADM mass of the manifold, and the capacity of the singul…
A new model clusters network nodes based on relative edge weights.
problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.
Here we present a novel approach to statistical analysis of financial time series. The approach is based on n-grams frequency dictionaries derived from the quantized market data. Such dictionaries are studied by evaluating their information capacity using relative entropy. A specific quantization of (originally conti…
New method lowers spherical perceptron capacity using fully lifted random duality theory.
problem Tackles the negative spherical perceptron capacity, a long-standing open problem.
method Develops fully lifted random duality theory (fl RDT) to characterize capacity.
result Shows remarkable closed-form analytical relations for practical capacity values.
First we review the definition of a negative point mass singularity. Then we examine the gravitational lensing effects of these singularities in isolation and with shear and convergence from continuous matter. We review the Inverse Mean Curvature Flow and use this flow to prove some new results about the mass of a sing…
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior [30, 42, 49]. The framework assumes a unit f…
In this paper we show the existence of weak solutions w:M→R of the inverse mean curvature flow starting from a relatively compact set (possibly, a point) on a large class of manifolds satisfying Ricci lower bounds. Under natural assumptions, we obtain sharp estimates for the growth of w and f…
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 using symplectic embeddings and recovers the metric when W is the unit disc-cotangent bundle. result The distance function ρW recovers the Riemannian metric when W is the unit disc-cotangent bundle. 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.
This paper extends financial theory to measure learnable market structure under computational constraints.
problem Understanding learnable market structure under bounded computational capacity.
method Introduces financial epiplexity as a measure of learnable market structure, extending classical information theory.
result Proves that equal entropy does not imply equal epiplexity and derives thresholds for useful regimes.
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…
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.
Dual-objective GANs reduce training instabilities with tunable α-loss parameters.
problem Training instabilities in Generative Adversarial Networks (GANs).
method Introduce (αD,αG)-GANs with dual objectives modeled using α-loss. result Upper bounds on estimation error show improved performance under certain conditions.
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.
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.
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…