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

63125188250 · Jun 202019922001200920172026
48 results for capacity assumptions

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.

Study on uniquely determining thermal properties from boundary temperature and heat flux measurements.

problem Determine thermal conductivity and volumetric heat capacity from boundary measurements.
method Uniqueness proof for isotropic and anisotropic media under thermal diffusivity assumption.
result Uniqueness of thermal properties in all dimensions and up to a gauge in two dimensions.

Study characterizes hulls and capacities on Riemannian manifolds, proving isoperimetric inequalities.

problem Characterizing hulls and capacities on Riemannian manifolds.
method Investigates strictly outward minimising hulls and uses p-capacities to recover their areas.
result Sharp isoperimetric inequality on complete noncompact manifolds with nonnegative Ricci curvature.

Study on risk measures using distorted Choquet integrals with random distortions.

problem Developing risk measures under random distortions of capacities.
method Introducing and analyzing randomly distorted Choquet integrals with respect to a distorted capacity, establishing properties and providing representations.
result Representation of comonotonic additive conditional risk measures using G-randomly distorted Choquet integrals.

Paper applies theorem to find optimal investment boundary in stochastic capacity expansion.

problem Finding optimal investment boundary in a stochastic, time-inhomogeneous capacity expansion problem.
method Applies Bank and El Karoui Representation Theorem to solve first order conditions involving a non-integral term.
result Existence of base capacity ly(t)l^{\star}_y(t), showing optimal investment process becomes active at this level.

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.

Variational Autoencoders (VAEs) represent the given data in a low-dimensional latent space, which is generally assumed to be Euclidean. This assumption naturally leads to the common choice of a standard Gaussian prior over continuous latent variables. Recent work has, however, shown that this prior has a detrimental ef…

2020-02-12abs ↗pdf ↗

Study optimizes pricing under uncertainty and capacity constraints.

problem Optimizing pricing decisions under demand uncertainty and capacity constraints.
method Analyzes linear demand, stochastic noise, and finite capacity; uses certified demand forecasts and control variates.
result Certified demand forecasts reduce regret from O(T)O(\sqrt{T}) to O(logT)O(\log T) under certain conditions.

Normalizing flows are shown to be equivalent to Bayesian networks, revealing new insights.

problem Understanding the limitations and capabilities of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models and analyzing their structure.
result Normalizing flows can be reduced to Bayesian networks, revealing new insights into their structure and capabilities.

Researchers analyze backdoor data poisoning attacks and identify a memorization capacity parameter.

problem Understanding and mitigating backdoor data poisoning attacks in machine learning models.
method Formal theoretical framework, statistical and computational analysis, explicit constructions, and algorithm design.
result Identified a memorization capacity parameter to assess vulnerability to backdoor attacks and developed algorithms to detect and mitigate them.

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…

2019-11-26abs ↗pdf ↗

Study analyzes adversarial training dynamics without data distribution assumptions.

problem Understanding training dynamics of adversarial training without data distribution assumptions.
method Mean field theory approach to analyze adversarial training in random deep neural networks.
result Upper bounds of adversarial loss derived empirically and theoretically.

We show that the non pluripolar product of positive currents is a bimeromorphic invariant. Under some natural assumptions, we show that the (weighted) energy associated to big cohomology classes are also bimeromorphic invariants. We compare the weighted energy functionals of currents with respect to different cohomolog…

2013-11-28abs ↗pdf ↗

This research proves guarantees on sequence models' generalization to longer and novel sequences.

problem Generalization to longer sequences and novel token combinations in sequence models.
method Provable guarantees on length and compositional generalization for various sequence models.
result Limited capacity models achieve both length and compositional generalization with diverse training distributions.

Paper develops an online learning algorithm for functional data models.

problem Recovering slope functions or predictors in functional data models.
method Online regularized learning algorithm in reproducing kernel Hilbert spaces with polynomially decaying step-size.
result Established fast convergence rates for estimation error without capacity assumption.

Transformers learn to cluster Gaussian mixtures as well as the EM algorithm.

problem Learning guarantees of Transformers in multi-class clustering of Gaussian mixtures.
method Developed a theory connecting Transformer's Softmax Attention layers to the EM algorithm's workflow.
result Transformers achieve minimax optimal rate for clustering Gaussian mixtures with sufficient training samples and initialization.

Optimal rates for vector-valued regression on various norms.

problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.

Proves generalization bounds for SGD using Feller processes and Hausdorff dimension.

problem Characterizing generalization properties of SGD in deep learning.
method Proves generalization bounds for SGD under Feller process approximation, linking generalization error to the Hausdorff dimension of trajectories.
result Generalization error controlled by the Hausdorff dimension of trajectories, which is linked to the tail behavior of the driving process.

The paper addresses adversarial robustness in in-context learning models.

problem Adversarial distribution shifts threaten the reliability of in-context learning models.
method A distributionally robust meta-learning framework is introduced to provide worst-case performance guarantees under Wasserstein-based distribution shifts.
result Model robustness scales with the square root of its capacity and is penalized by the square of the perturbation magnitude.

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 ↗

The emerging concern about data privacy and security has motivated the proposal of federated learning, which allows nodes to only synchronize the locally-trained models instead their own original data. Conventional federated learning architecture, inherited from the parameter server design, relies on highly centralized…

2019-08-21abs ↗pdf ↗

Deep models can't generate heavy-tailed samples well.

problem Understanding the limitations of deep generative models in generating samples with heavy tails.
method Unified framework using concentration of measure and convex geometry, Gromov-Levy inequality.
result Deep generative models are not universal generators and can only produce concentrated samples with light tails.

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.

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.