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

6371,2741,9102,547 · Jun 202019922001200920172026
48 results for source and capacity conditions

Study derives error decay rates for kernel classification under source and capacity conditions.

problem Understanding prediction error decay rates for real data sets.
method Derived decay rates for misclassification error under Gaussian design for SVM and ridge classification.
result Rates accurately describe learning curves for data sets satisfying source and capacity conditions.

The paper constructs optimal confidence bands for kernel gradient flow estimators.

problem Estimating generalization error and constructing confidence bands for kernel gradient flows.
method Established convergence rates and constructed optimal confidence bands under capacity-source condition.
result Optimal confidence bands for kernel gradient flows have shrinkage rates close to minimax optimal rates.

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.

GD outperforms ridge regression and SGD in linear regression problems.

problem Comparing the risks of GD, ridge regression, and SGD in linear regression problems.
method Instance-wise finite-sample risk analysis of GD, ridge regression, and SGD.
result GD outperforms ridge regression and is incomparable with SGD in some cases.

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.

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.

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 ↗

Adding noise controls capacity of function compositions.

problem Large capacity of function compositions with bounded capacity classes.
method Adding Gaussian noise to the output of F\mathcal{F} before composing with H\mathcal{H}.
result Noise effectively controls the capacity of HF\mathcal{H} \circ \mathcal{F}, offering a general recipe for modular design.

Symplectic fillings of prequantization bundles are shown to be disk bundles under certain conditions.

problem Characterizing symplectic fillings of prequantization bundles with finite capacities.
method Analysis of symplectic capacities and diffeomorphisms.
result Symplectic fillings of prequantization bundles are diffeomorphic to disk bundles under finite capacity conditions.

We estimate Radon-Nikodym derivatives using regularization in reproducing kernel Hilbert spaces.

problem Estimating Radon-Nikodym derivatives in various applications.
method General regularization scheme in reproducing kernel Hilbert spaces.
result High order accuracy in reconstructing Radon-Nikodym derivatives at any point.

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.

Domain adaptation (DA) is an important and emerging field of machine learning that tackles the problem occurring when the distributions of training (source domain) and test (target domain) data are similar but different. Current theoretical results show that the efficiency of DA algorithms depends on their capacity of …

2016-10-14abs ↗pdf ↗

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.

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.

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.

New method disentangles sources of different timescales in planetary seismic data.

problem Unsupervised source separation of multi-scale seismic data from planetary missions.
method Wavelet scattering spectra for multi-scale clustering and variational autoencoder for source separation.
result Disentangles sources with different timescales in InSight mission seismic data.

The paper connects mass, harmonic functions, and capacity in asymptotically flat 3-manifolds.

problem Connections among ADM mass, harmonic functions, and capacity in asymptotically flat 3-manifolds.
method New formulae for ADM mass via harmonic functions, monotone quantities, and geometric inequalities.
result The mass-to-capacity ratio is bounded below by 1 - sqrt(normalized Willmore functional of the boundary).

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 use drifted Brownian motion in warped product model spaces as comparison constructions to show pp-hyperbolicity of a large class of submanifolds for p2p\ge 2. The condition for pp-hyperbolicity is expressed in terms of upper support functions for the radial sectional curvatures of the ambient space and for the rad…

2006-10-31abs ↗pdf ↗

Scattering networks maximize separation on low-dimensional data.

problem Maximizing separation capacity on low-dimensional datasets.
method Characterize and bound separation capacity for feature extractors, then apply to scattering networks with specific criteria.
result Design criteria for scattering networks to maximize separation on low-dimensional data.

This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior [30, 42, 49]. The framework assumes a unit f…

2019-10-04abs ↗pdf ↗

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.

Maximizes capacity of extensions with fixed boundary data.

problem Maximizing the capacity of extensions with nonnegative scalar curvature.
method Using the method of Lagrange multipliers on the constraint space of scalar-flat extensions.
result Derives variational condition for maximal capacity extensions and proves they have constant scalar curvature.

CWAN tackles multi-source heterogeneous domain adaptation with conditional weighting.

problem Learning cross-domain samples from multiple heterogeneous domains.
method CWAN uses a feature transformer, label classifier, and domain discriminator to learn from multiple sources.
result CWAN outperforms state-of-the-art methods on four real-world datasets.

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.

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.

The paper bridges spectral and spatial graph convolutions, improving model capacity and transferability.

problem Improving graph neural networks by bridging spectral and spatial design.
method Theoretical demonstration and general framework for spectral analysis, new spectral convolutions, and depthwise separable convolutions.
result General framework allows spectral analysis of ConvGNNs, showing their performance and limits, and proposing new spectral convolutions.

We address the problem of one-to-many mappings in supervised learning, where a single instance has many different solutions of possibly equal cost. The framework of conditional variational autoencoders describes a class of methods to tackle such structured-prediction tasks by means of latent variables. We propose to in…

2019-08-23abs ↗pdf ↗

Following the recent work on capacity allocation, we formulate the conjecture that the shattering problem in deep neural networks can only be avoided if the capacity propagation through layers has a non-degenerate continuous limit when the number of layers tends to infinity. This allows us to study a number of commonly…

2019-03-11abs ↗pdf ↗

Compared with shallow domain adaptation, recent progress in deep domain adaptation has shown that it can achieve higher predictive performance and stronger capacity to tackle structural data (e.g., image and sequential data). The underlying idea of deep domain adaptation is to bridge the gap between source and target d…

2018-11-15abs ↗pdf ↗

Agents trained with deep reinforcement learning algorithms are capable of performing highly complex tasks including locomotion in continuous environments. We investigate transferring the learning acquired in one task to a set of previously unseen tasks. Generalization and overfitting in deep reinforcement learning are …

2019-09-03abs ↗pdf ↗