Optimizes insurance processing capacity to minimize costs.
problem Processing delays and backlogs in insurance claims.
method Optimal capacity selection to minimize delay-adjusted and fixed costs.
result Minimizes claims costs by balancing processing capacity and delays.
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.
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.
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.
Nonlinear RNNs' memory capacity varies widely, making it impractical.
problem The usefulness of memory capacity as a metric for linear RNNs is questioned.
method Analysis of random nonlinear RNNs with varying input scales.
result Memory capacity of nonlinear RNNs is arbitrary and impractical.
A latent function decomposition method is proposed for forecasting the capacity of lithium-ion battery cells. The method uses the Multi-Output Gaussian Process, a generative machine learning framework for multi-task and transfer learning. The MCGP decomposes the available capacity trends from multiple battery cells int…
Model for cross-border markets with limited transmission capacities.
problem Limited transmission capacities between two countries' markets.
method Developed a regime-switching process model with high-frequency approximation.
result Analytic tractability allows computation of key market quantities.
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 study a stochastic, continuous time model on a finite horizon for a firm that produces a single good. We model the production capacity as an Ito diffusion controlled by a nondecreasing process representing the cumulative investment. The firm aims to maximize its expected total net profit by choosing the optimal inve…
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.
We consider the problem of finding optimal strategies that maximize the average growth-rate of multiplicative stochastic processes. For a geometric Brownian motion the problem is solved through the so-called Kelly criterion, according to which the optimal growth rate is achieved by investing a constant given fraction o…
Actuaries tackle loss of earning capacity in Denmark, balancing public benefits and private insurance.
problem Balancing public benefits and private insurance for loss of earning capacity in Denmark.
method Innovative approaches from researchers and practitioners, leveraging actuarial expertise.
result Development of equitable, data-driven solutions to mitigate risk and enhance societal well-being.
DNPUs improve neural network performance with high-capacity nanoelectronic nodes.
problem Limited performance of single DNPUs in solving complex classification problems.
method Developed DNPUs as high-capacity neurons and implemented multi-DNPU networks.
result Feed-forward DNPU networks improve single DNPU performance from 77% to 94% test accuracy.
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.
Using a new method we give elementary estimates for the capacity of non-contractible annuli on cylinders and provide examples, where these inequalities are sharp. Here the lower bound depends only on the area of the annulus. In the case of constant curvature this lower bound is obtained with the help of a symmetrizatio…
Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices, have recently been proposed as a means to avoid these issues. However, in previous …
New analysis explains pathology of deep Gaussian processes.
problem Pathology of deep Gaussian processes reduces learning capacities with increased layers.
method Study nonlinear dynamic systems corresponding to DGPs, derive recurrence relations.
result Provide tighter bounds and rate of convergence for dynamic systems.
We use drifted Brownian motion in warped product model spaces as comparison constructions to show p-hyperbolicity of a large class of submanifolds for p≥2. The condition for p-hyperbolicity is expressed in terms of upper support functions for the radial sectional curvatures of the ambient space and for the rad…
National statistical systems are the enterprises tasked with collecting, validating and reporting societal attributes. These data serve many purposes - they allow governments to improve services, economic actors to traverse markets, and academics to assess social theories. National statistical systems vary in quality, …
Study characterizes memory capacity of quantum reservoirs using transmon qubits.
problem Understanding the memory capacity of quantum reservoirs built with transmon qubits.
method Characterized memory capacity of quantum reservoirs using transmon qubits from IBM, focusing on NMSE and topology complexity.
result Found a peak in memory capacity for configurations with n-1 self-loops, suggesting optimal design for forecasting tasks.
Enhances neural network dynamics to boost computational capacity.
problem Improving computational capacity of neural networks.
method Introducing Phase Transition Adaptation to drive system dynamics towards edge of stability.
result Consistently achieves enhancement in computational capacity over multiple datasets.
Scalable Gaussian process models trained with unbiased stochastic ELBO.
problem Training large capacity Gaussian process models on huge datasets.
method Unbiased stochastic variational inference for scalable GPs.
result Accurate inference on large datasets with up to 10 million basis functions.
New measure FTC quantifies how much a ReLU network can fine-tune.
problem Analyzing memorization capacity in fine-tuned neural networks.
method Defined Fine-Tuning Capacity (FTC) for additive fine-tuning of ReLU networks.
result Upper and lower bounds on FTC for 2 and 3-layer ReLU networks.
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 UoHoY given S, with cognitive and total capacities. result Capacity-coupled Alignment Performance Interval derived from Fano and PAC-Bayes bounds.
Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …
Wide neural networks can degrade performance, contrary to conventional wisdom.
problem Understanding the limitations of increasing network width in neural networks.
method Using Deep Gaussian Processes to decouple capacity and width, analyzing their effects on representational power and non-Gaussianity.
result Wide neural networks can become less adaptable and more Gaussian, leading to performance degradation.
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), showing optimal investment process becomes active at this level. New analysis shows capacity of treelike neural networks with various activations.
problem Analyzing the capacity of treelike neural networks with diverse activations.
method Utilized Random Duality Theory and its partially lifted version to handle various activations.
result The capacity of treelike neural networks decreases for large network width but converges to a constant value.
New measure predicts Dutch housing market downturns.
problem Understanding causes of Dutch housing boom and bust.
method Modelled household lending capacity using bank formulas.
result New measure outperforms traditional measures in forecasting housing prices.
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.
Accurately predicting the future capacity and remaining useful life of batteries is necessary to ensure reliable system operation and to minimise maintenance costs. The complex nature of battery degradation has meant that mechanistic modelling of capacity fade has thus far remained intractable; however, with the advent…
We derive new inequalities between the boundary capacity of an asymptotically flat 3-manifold with nonnegative scalar curvature and boundary quantities that relate to quasi-local mass; one relates to Brown--York mass and the other is new. We argue by recasting the setup to the study of mean-convex fill-ins with nonnega…
Accurately predicting the future health of batteries is necessary to ensure reliable operation, minimise maintenance costs, and calculate the value of energy storage investments. The complex nature of degradation renders data-driven approaches a promising alternative to mechanistic modelling. This study predicts the ch…
We extend manifold capacity to nonlinear neural representations with contextual information.
problem Efficient processing of information through neural representations.
method Theoretical framework leveraging latent directions in input space related to contextual information.
result Derivation of an exact formula for context-dependent manifold capacity.
The paper proves concentration inequalities for two-sample rank processes and applies them to ranking performance criteria.
problem Measuring the performance of ranking statistics between two populations.
method Proves concentration inequalities for two-sample rank processes indexed by VC classes of scoring functions.
result Generalization capacity of empirical maximizers of ranking performance criteria is investigated.
Enhanced Hopfield model boosts memory retrieval capacity.
problem Memory retrieval in modern Hopfield models with limited capacity.
method Introduces a learnable feature map transforming energy function into kernel space, minimizing separation loss for uniform memory distribution.
result Significant reduction in metastable states, enhancing memory capacity and retrieval accuracy.
New method lowers spherical perceptron capacity using fully lifted random duality theory.
problem Tackles the negative spherical perceptron capacity, a long-standing open problem.
method Develops fully lifted random duality theory (fl RDT) to characterize capacity.
result Shows remarkable closed-form analytical relations for practical capacity values.
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.
In this article, we propose the notion of the general p-affine capacity and prove some basic properties for the general p-affine capacity, such as affine invariance and monotonicity. The newly proposed general p-affine capacity is compared with several classical geometric quantities, e.g., the volume, the p-var…
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.
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.
It is inconceivable how chaotic the world would look to humans, faced with innumerable decisions a day to be made under uncertainty, had they been lacking the capacity to distinguish the relevant from the irrelevant---a capacity which computationally amounts to handling probabilistic independence relations. The highly …
Recent work has shown that topological enhancements to recurrent neural networks (RNNs) can increase their expressiveness and representational capacity. Two popular enhancements are stacked RNNs, which increases the capacity for learning non-linear functions, and bidirectional processing, which exploits acausal informa…
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.
Estimates graph process with high-frequency data, proving asymptotic properties.
problem Estimating graph process with high-frequency data.
method Discretized maximum likelihood estimators for GrOU process under high-frequency sampling.
result Asymptotic central limit theorems for estimators under finite and infinite jump activity.
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.