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

58117175233 · Jun 202019922001200920172026
48 results for capacity sizing

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.

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.

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.

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 ↗

A new memory system handles non-stationary environments by self-sizing and retaining memories.

problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.

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…

2017-01-18abs ↗pdf ↗

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 …

2019-02-22abs ↗pdf ↗

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…

2010-10-26abs ↗pdf ↗

A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances that can fit in memory - must grow with the data set size. In practice, while one c…

2016-05-31abs ↗pdf ↗

External or internal shocks may lead to the collapse of a system consisting of many agents. If the shock hits only one agent initially and causes it to fail, this can induce a cascade of failures among neighoring agents. Several critical constellations determine whether this cascade remains finite or reaches the size o…

2012-09-05abs ↗pdf ↗

gLSTM improves graph neural networks by increasing storage capacity to prevent over-squashing.

problem Over-squashing in GNNs collapses information from a large receptive field into a single vector, creating an information bottleneck.
method Introduced a new synthetic task to measure over-squashing and adapted ideas from sequence modeling to develop gLSTM, a novel GNN architecture with improved capacity.
result gLSTM architecture demonstrates strong performance on synthetic and real-world graph benchmarks, mitigating over-squashing.

Study on neural networks' storage capacity and solution space structure.

problem Understanding the storage capacity and solution space structure of neural networks.
method Replica method from statistical physics.
result Storage capacity per parameter remains finite even with infinite width and weights exhibit negative correlations.

Modeling alignment as resource-limited cognitive processes, researchers derive performance bounds.

problem Systematic deviations in feedback-based alignment of large language models.
method Modeling alignment as a two-stage cascade UoHoYU o H o Y given SS, with cognitive and total capacities.
result Capacity-coupled Alignment Performance Interval derived from Fano and PAC-Bayes bounds.

Researchers analyze neural process architectures and their representational capacities.

problem Understanding what functions can be represented by different neural process architectures.
method Analyzing four types of neural process architectures: CNPs, ANPs, TNPs, and their latent variants.
result Prove these architectures form a strict hierarchy and characterize their representational capabilities.

Reduced reservoir size for faster edge computing.

problem Efficiently reducing computational resources for reservoir computing.
method Concatenating past or drifting states of the reservoir to the output layer.
result Reduced reservoir size up to one tenth without significant error increase.

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.

Theory of MoE Transformers' generalization and scaling.

problem Understanding the generalization and scaling of Mixture-of-Experts (MoE) Transformers.
method Developed a theory that separates active capacity from routing combinatorics, derived a sup-norm covering-number bound, and proved a constructive approximation theorem.
result Generalization and scaling laws for MoE Transformers, showing how active capacity and routing structure affect performance.

Two-layer neural networks learn features through a few gradient descent steps, improving approximation capacity.

problem Improving approximation capacity of two-layer neural networks.
method Theoretical investigation of a two-layer neural network's adaptation to target function through a few gradient descent steps.
result Learning multiple target directions requires a larger batch size and more gradient steps, improving approximation capacity.

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…

2012-10-08abs ↗pdf ↗

Sparse codes improve optimal control tasks with correlated inputs.

problem Optimal control tasks with correlated feature inputs.
method Used a sparse code to represent natural images in an optimal control task solved with neuro-dynamic programming.
result An over-complete sparse code increases memory capacity and learning speed beyond a complete code.

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.

Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.

problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.

Graph neural networks struggle to distinguish certain graph structures.

problem Difficulty in distinguishing graphs with graph neural networks.
method Analysis of communication capacity in message-passing model of graph neural networks.
result Capacity of MPNN needs to grow linearly for trees and quadratically for general connected graphs.

Modern machine learning models are typically trained using Stochastic Gradient Descent (SGD) on massively parallel computing resources such as GPUs. Increasing mini-batch size is a simple and direct way to utilize the parallel computing capacity. For small batch an increase in batch size results in the proportional red…

2018-06-15abs ↗pdf ↗

We present a novel framework of knowledge distillation that is capable of learning powerful and efficient student models from ensemble teacher networks. Our approach addresses the inherent model capacity issue between teacher and student and aims to maximize benefit from teacher models during distillation by reducing t…

2019-11-29abs ↗pdf ↗

Expressive efficiency refers to the relation between two architectures A and B, whereby any function realized by B could be replicated by A, but there exists functions realized by A, which cannot be replicated by B unless its size grows significantly larger. For example, it is known that deep networks are exponentially…

2017-03-06abs ↗pdf ↗

This work studies scaling laws for low-precision training in high-dimensional linear regression.

problem Optimizing trade-off between model quality and training costs in high-dimensional linear regression.
method Theoretical study of scaling laws for low-precision training within a high-dimensional sketched linear regression framework, analyzing multiplicative and additive quantization.
result Multiplicative quantization maintains full-precision model size, while additive quantization reduces effective model size.

A new ensemble learning method called Residual Likelihood Forests improves performance and reduces model size.

problem Improving machine learning classification performance with compact models.
method Sequential optimization of conditional likelihoods in a boosting-like framework, combining multiplicatively.
result Significant performance improvements and reduced model size compared to other ensemble methods.

ChatGPT predicts stock market reactions from news headlines without financial training.

problem Predicting stock price movements using non-financial data.
method Used post-knowledge-cutoff headlines to train ChatGPT-4, which forecasts stock market reactions.
result ChatGPT-4 can predict stock market reactions with high accuracy, especially for small stocks and negative news.

Credit networks represent a way of modeling trust between entities in a network. Nodes in the network print their own currency and trust each other for a certain amount of each other's currency. This allows the network to serve as a decentralized payment infrastructure---arbitrary payments can be routed through the net…

2010-07-03abs ↗pdf ↗