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,742 papers · 148 categories

Trend · papers per month

336698131 · Jun 202019922001200920172026
48 results for Exponential storage capacity

Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.

problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.

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.

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.

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 ↗

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.

It has been known for a long time that the classical spherical perceptrons can be used as storage memories. Seminal work of Gardner, \cite{Gar88}, started an analytical study of perceptrons storage abilities. Many of the Gardner's predictions obtained through statistical mechanics tools have been rigorously justified. …

2013-06-17abs ↗pdf ↗

The study improves the perceptron's storage capacity by optimizing variable selection.

problem Distinguishing genuine structure from random correlations in high-dimensional data.
method Replica method from statistical mechanics for optimal variable selection.
result Optimal variable selection can surpass the Cover--Gardner bound for pattern classification.

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.

Sharp limits found for storing and retrieving input-output associations in linear associative memories.

problem Understanding the fundamental limits of storing and retrieving input-output associations in neural networks.
method Study of a minimal linear associative memory model, introducing a decoupled model and using statistical physics to characterize storage capacity.
result Linear associative memory can store up to 1/2 log(p) associations, providing a sharp statistical-physics characterization.

Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.

problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.

Framework uses RL and simulation for optimal microgrid energy storage planning.

problem Optimal investment in diverse energy storage technologies for microgrids.
method Combines reinforcement learning with simulation-based optimization for long-term planning.
result Derives better engineering solutions for future microgrid applications.

Generative models improve carbon storage site prediction using Bayesian inversion.

problem Predicting suitable geologic sites for long-term carbon dioxide storage.
method Generative adversarial networks and Bayesian inversion to condition models on physical measurements and historic data.
result Improved resolution of carbon dioxide storage capacity forecasts.

Game theory models storage investment to balance market competition and profits.

problem Strategic storage investment impacts electricity market prices and revenues.
method Formulated a non-cooperative game between investors to model strategic storage decisions.
result Increasing storage capacity reduces individual profits but increases total investment.

Study on energy storage's impact on electricity prices and profitability.

problem Analyzing the profitability of energy storage in electricity markets.
method Characterized optimal operating strategy for storage systems, determined equilibrium price in a market with storage, renewables, and conventional producers, and characterized price process using stochastic differential equations.
result Increased average revenues and interquantile ranges for storage assets in energy transition scenarios.

This study investigates self-organizing dynamics in a stochastic exponential DAM model using Temporal Complexity.

problem Understanding self-organizing behavior in artificial neural systems.
method Investigation of a stochastic exponential DAM model through Temporal Complexity analysis.
result The model exhibits regimes of complex intermittency with nontrivial temporal correlations and scale-free behavior.

Normalization layers control deep neural network capacity, improving stability and generalization.

problem Excessive capacity in deep neural networks leads to overfitting and poor generalization.
method Developed a theoretical framework to explain normalization's role in capacity control.
result Normalization layers reduce the Lipschitz constant exponentially, smoothing the loss landscape and enhancing generalization.

DMs emerge from DenseAMs, transitioning from memorization to generalization.

problem Hindered memory retrieval in DenseAMs due to spurious states.
method Examined diffusion models through the lens of DenseAMs, focusing on their generative process.
result Identified a critical phase in DMs transitioning from memorization to generalization.

New findings challenge the importance of forecast accuracy in battery storage optimization, highlighting the role of rank correlation instead.

problem The challenge of optimizing battery storage dispatch decisions in multi-market electricity trading using forecast accuracy metrics.
method A hierarchical three-layer optimization system trading in multiple markets (FCR, aFRR, day-ahead, intraday) with real market data.
result Rank correlation (Kendall tau) is a better predictor of intraday dispatch value than forecast accuracy (MAE), with a threshold of tau around 0.85-0.95 capturing up to 97-100% of perfect-foresight revenue.

This study optimizes energy storage scheduling under price uncertainty, balancing risk and reward.

problem Optimizing energy storage operation under price uncertainty and risk.
method Two-stage stochastic risk-constrained approach using conditional value-at-risk.
result Increasing risk aversion leads to substantial benefits in terms of risk reduction and expected reward.

Study stability of selective SSMs with discontinuous gating.

problem Challenges in stability analysis of selective SSMs with discontinuous gating.
method Passivity and Input-to-State Stability (ISS) analysis of continuous-time selective SSMs.
result Derivation of sufficient conditions for global ISS with respect to the port input.

Transformers learn to recall with non-orthogonal embeddings in realistic settings.

problem Understanding how transformers store and retrieve knowledge in practical scenarios.
method Analyzing a single-layer transformer with random embeddings trained on a token-retrieval task.
result Explicit formulas for the model's storage capacity reveal a multiplicative dependence on sample size, embedding dimension, and sequence length.

Transformers can store facts efficiently using associative memories.

problem Understanding how transformers store and recall factual information.
method Proved linear scaling of storage capacities for linear and MLP associative memories, introduced a synthetic task, and analyzed gradient flow.
result Shallow transformers can achieve near optimal storage capacity for factual recall tasks using associative memories.

Paper tackles inventory management with deep learning, improving performance and adherence to constraints.

problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.

Paper optimizes battery storage in multiple energy markets for better profits.

problem Optimizing battery storage participation in multiple energy markets to balance supply and demand.
method Developed a joint bidding strategy combining intraday and frequency markets using mixed integer linear programming and a learned classifier strategy.
result The LCS increases overall profits by over 4% compared to static strategies and by more than 3% over a naive dynamic benchmark.

Dense Associative Memories outperform classical networks in robustness and signal processing.

problem Improving neural network performance in adversarial attacks and weak signal processing.
method Relaxing replica symmetry in statistical mechanics of spin glasses to analyze unsupervised and supervised learning.
result Explicit analytical investigation of phase diagrams and storage capacities for Dense Associative Memories.

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.

We improve deep threshold networks' memorization capacity exponentially.

problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O~(1δ+n)\widetilde{\mathcal{O}}(\frac{1}{\delta} + \sqrt{n}) neurons and O~(dδ+n)\widetilde{\mathcal{O}}(\frac{d}{\delta} + n) weights are sufficient.

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 ↗

The huge amount of available data nowadays is a challenge for kernel-based machine learning algorithms like SVMs with respect to runtime and storage capacities. Local approaches might help to relieve these issues and to improve statistical accuracy. It has already been shown that these local approaches are consistent a…

2019-03-01abs ↗pdf ↗

Product Kanerva Machines dynamically combine smaller models for better memory organization.

problem Limited organization in the Kanerva Machine.
method Introducing Product Kanerva Machines that dynamically combine multiple smaller Kanerva Machines.
result Product Kanerva Machines can discover spatial tunings that approximately factorize simple images by object.

DeepRC uses Hopfield networks and attention to classify immune repertoires.

problem Classifying the vast number of immunosequences of an individual.
method Integrates transformer-like attention into deep learning architectures.
result DeepRC outperforms other methods in predictive performance.

The problem of high-dimensional and large-scale representation of visual data is addressed from an unsupervised learning perspective. The emphasis is put on discrete representations, where the description length can be measured in bits and hence the model capacity can be controlled. The algorithmic infrastructure is de…

2019-01-24abs ↗pdf ↗

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

2018-09-06abs ↗pdf ↗