The paper introduces a new geometric capacity and proves inequalities related to it.
problem Developing a new geometric capacity and comparing it to classical quantities.
method Introducing the general p-affine capacity and proving its properties and inequalities. result Sharp geometric inequalities for the general p-affine capacity are derived. 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.
We derive explicit recursive formulas for Target Close (TC) and Implementation Shortfall (IS) in the Almgren-Chriss framework. We explain how to compute the optimal starting and stopping times for IS and TC, respectively, given a minimum trading size. We also show how to add a minimum participation rate constraint (Per…
Investigates tempered stable distributions and processes, including density transformations and parameter estimation.
problem Understanding the properties and applications of tempered stable distributions and processes.
method Analysis of limit distributions, parameter estimation, density transformations, and computation of p-variation indices. result Computed p-variation indices for tempered stable processes and discussed exponential stock models driven by these processes. Bitcoin volatility shows multifractal structure, contradicting rough volatility models.
problem Applying rough volatility models to Bitcoin volatility data.
method Normalised p-variation framework, multifractal Detrended Fluctuation Analysis, log-log moment scaling, wavelet leaders.
result Bitcoin volatility exhibits multifractal structure, violating rough volatility model assumptions.
Unified approach to stochastic control, filtering, and stopping using rough paths.
problem Addressing gaps in classical problems of stochastic control, filtering, and stopping.
method Combining rough path theory with controlled rough paths to provide a pathwise deterministic framework.
result Established rigorous connection between candidate solutions and Hamilton-Jacobi-Bellman equation.
Paper introduces new Lp q-torsional measure and solves Minkowski problem.
problem Solving the Minkowski problem for q-torsional rigidity. method Established Lp variational formula and proved existence of solutions. result Existence of solutions to Lp Minkowski problem for specific measures. New method detects changes in high-dimensional Gaussian data streams.
problem Detecting changes in high-dimensional data streams.
method Likelihood ratio tests across scales and coordinates.
result Patience (null rejection rate) at desired level, response delay under alternative.
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.
Proves existence and uniqueness of solutions to Lp Minkowski problem for electrostatic p-capacity.
problem Existence and uniqueness of solutions to Lp Minkowski problem for electrostatic p-capacity.
method Proved existence and uniqueness of solutions for specific ranges of p and p-capacity.
result Proves existence and uniqueness of solutions for Lp Minkowski problem for electrostatic p-capacity.
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.
Extends capacity analysis to neural networks, showing how capacity is distributed across layers.
problem How capacity is distributed in neural networks with non-linear layers.
method Introduces layer decoupling to quantify non-linear activation's impact, and uses a markovian rule for capacity propagation in deep networks.
result Shows that under certain conditions, capacity allocation in neural networks is equivalent to linear capacity allocation in an extended input space.
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.
Full-capacity uRNNs improve performance over restricted-capacity ones.
problem Vanishing and exploding gradient issues in recurrent neural networks.
method Optimized full-capacity unitary recurrence matrices over all unitary matrices.
result Significantly improved performance compared to LSTMs and restricted-capacity uRNNs.
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.
Extends recommender methods to respect capacity constraints.
problem Recommendation under capacity constraints in various settings.
method Extend three state-of-the-art latent factor recommendation approaches (PMF, GeoMF, BPR) to optimize for both recommendation accuracy and expected item usage that respects capacity constraints.
result Experimental results highlight the benefit of the method for recommendation under capacity constraints.
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.
We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimati…
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.
The paper introduces capacity allocation analysis for neural networks, focusing on spatial capacity.
problem Designing neural network architectures is challenging due to the interplay of intuition, experimentation, and luck.
method Introduces capacity allocation analysis, focusing on spatial capacity allocation in linear settings.
result Quantitative comparison of classical architectures on various synthetic tasks reveals insights into model capacity allocation.
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.
Estimates the capacity of face representations, providing upper bounds for automatic face recognition.
problem Estimating how many identities a face representation can resolve.
method Formulated as packing bounds on a low-dimensional manifold embedded in a deep representation space, accounting for manifold structure and noise.
result Demonstrated upper bounds of 2.7×10^4 and 8.4×10^4 for FaceNet and SphereFace at a FAR of 1%, respectively.
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.
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.
The paper examines the capacity dimension of boundaries in CAT(0) spaces.
problem Understanding the capacity dimension of boundaries in CAT(0) spaces.
method Comparison of metrics and study of buildings, with a method for proving asymptotic dimension finiteness.
result Visual and conical metrics on the boundary of hyperbolic CAT(0) spaces give the same capacity dimension.
SER tool predicts storage capacity risk with probabilistic accuracy.
problem Managing data storage growth to avoid financial losses.
method Stochastic Estimated Risk (SER) using Brownian motion with drift model.
result Probabilistic approach is more accurate for non-linear storage patterns.
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.
Deep learning boosts cable capacity by 19%.
problem Maximizing cable capacity under power constraints.
method Optimized launch powers using deep neural networks.
result 19% increase in capacity per Watt.
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.
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.
Study geometric flow driven by curvature and capacity potential.
problem Understanding motion of sets via curvature and capacity potential.
method Local well-posedness and two weak formulations proposed.
result Established local well-posedness and proposed weak formulations.
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.
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.
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. 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.