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

127253380506 · Jun 202019922001200920172026
48 results for estimation capacity

Managing data storage growth is of crucial importance to businesses. Poor practices can lead to large data and financial losses. Access to storage information along with timely action, or capacity forecasting, are essential to avoid these losses. In addition, ensuring high accuracy of capacity forecast estimates along …

2018-12-01abs ↗pdf ↗

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.

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.

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.

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 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 ↗

Previously, Cristofaro-Gardiner, Hutchings and Ramos have proved that embedded contact homology (ECH) capacities can recover the volume of a contact 3-manifod in their paper "the asymptotics of ECH capacities" . There were two main steps to proving this theorem: The first step used an estimate for the energy of min-max…

2018-01-08abs ↗pdf ↗

Proposes unbiased estimators for training mixture of experts models.

problem Efficiently training large-scale mixture of experts models on modern hardware.
method Two unbiased estimators based on principled stochastic assignment procedures.
result Both estimators are more effective and robust than biased alternatives.

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 ↗

New algorithm for shareable arms with load-dependent rewards in stochastic bandits.

problem Learning optimal play strategy with shareable finite-capacity arms in stochastic bandits.
method Developed a capacity estimator and online learning algorithm for MP-MAB with shareable arms.
result Regret upper bound matches the lower bound, validating the algorithm's performance.

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.

The paper extends IPC framework to stationary physical systems and validates it with a photonic system.

problem Characterizing the computational capabilities of stationary physical systems in a principled, data-efficient way.
method Extended IPC framework, established fundamental results, derived asymptotic bias, introduced data-efficient estimation methods.
result IPC strongly correlates with machine-learning performance and provides a reliable estimate of system dimensionality.

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.

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.

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.

New study shows how model complexity affects test risk, challenging classical theory.

problem Understanding how test risk scales with model complexity for large over-parametrized deep networks.
method Developed norm-based capacity measures for random features based estimators, providing precise characterization of estimator's norm concentration and test error.
result Predicted learning curve shows a phase transition from under- to over-parameterization, confirming classical U-shaped behavior with appropriate capacity measures.

Study shows how correlations between neural activity affect classification capacity.

problem Understanding how correlations between neural activity impact classification performance.
method Calculated the capacity of neural activity on spherical manifolds with and without correlations between centroids and axes.
result Introducing correlations between neural activity centroids pushes spheres closer together, while correlations between axes shrink their radii, revealing a duality between correlations and geometry in classification.

Study on existence and properties of continuous solutions to complex Hessian equations.

problem Existence and properties of continuous solutions to complex Hessian equations.
method Established new capacity estimates and weak stability estimates for the mm-Hessian measure.
result Existence of continuous solutions to the complex Hessian equation under certain conditions.

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.

Study optimal treatment assignment policies under strategic agent responses.

problem Learning optimal treatment policies with strategic agents complicates estimation.
method Dynamic model with threshold convergence to mean-field equilibrium, consistent estimator for policy gradient.
result Threshold for treatment assignment converges to mean-field equilibrium threshold under large but finite number of agents.

Derives new monotone quantities for p-harmonic functions on asymptotically flat 3-manifolds.

problem Estimating the mass of 3-manifolds with non-negative scalar curvature and minimal boundary.
method Derives monotone quantities for p-harmonic functions and applies them to derive a sharp mass-capacity estimate.
result Derives a sharp mass-capacity estimate relating the ADM mass of a 3-manifold to the p-capacity of its boundary.

A long standing open problem in the theory of neural networks is the development of quantitative methods to estimate and compare the capabilities of different architectures. Here we define the capacity of an architecture by the binary logarithm of the number of functions it can compute, as the synaptic weights are vari…

2019-01-02abs ↗pdf ↗

We provide a rigorous mathematical treatment to the crowding issue in data visualization when high dimensional data sets are projected down to low dimensions for visualization. By properly adjusting the capacity of high dimensional balls, our method makes right enough room to prepare for the embedding. A key component …

2019-09-29abs ↗pdf ↗

Estimates on Einstein manifolds improve Brownian motion behavior and curvature limits.

problem Improving estimates on Einstein manifolds for Brownian motion behavior.
method Generalizing Benjamini-Pemantle-Peres estimate to manifolds with Ricci curvature bounds.
result Sharp estimates for Brownian motion on high curvature parts of Ricci-flat manifolds.

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 MM-parabolic manifolds.

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 ↗

In this paper, we introduce the anisotropic Sobolev capacity with fractional order and develop some basic properties for this new object. Applications to the theory of anisotropic fractional Sobolev spaces are provided. In particular, we give geometric characterizations for a nonnegative Radon measure μμ that naturall…

2014-10-02abs ↗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 ↗

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.

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\ell_0 spherical perceptron and implicitly the ReLU layers injectivity.
result The lifting mechanism converges remarkably fast with relative corrections not exceeding 0.1%.

New bounds on neural network capacity for treelike sign perceptrons using RDT.

problem Determining the capacity of treelike sign perceptrons neural networks.
method Random Duality Theory (RDT) to establish upper bounds.
result Mathematically rigorous bounds on network capacity for any number of neurons.

The memory capacity of linear echo state networks is accurately calculated using new numerical methods.

problem Numerical evaluations of memory capacity in recurrent neural networks often contradict theoretical bounds.
method Developed robust numerical approaches exploiting MC neutrality with respect to the input mask matrix.
result Memory curves fully agree with theory when using the proposed methods.

Let XX be a compact Kähler manifold and $\om$ a smooth closed form of bidegree (1,1)(1,1) which is nonnegative and big. We study the classes ${\mathcal E}_χ(X,\om)$ of $\om$-plurisubharmonic functions of finite weighted Monge-Ampère energy. When the weight χχ has fast growth at infinity, the corresponding functions are …

2007-04-06abs ↗pdf ↗