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

Trend · papers per month

69138206275 · Jun 202019922001200920172026
48 results for any-dimensional inputs

Develops a new approach to establish universality for any-dimensional machine learning models.

problem Understanding universality for models with inputs of varying sizes.
method Identifies any-dimensional functions with a unique function in an infinite-dimensional limit space, using symmetries and relations between inputs of different sizes.
result Establishes universality for several existing architectures and proposes modifications to restore it.

New method uses scalars to approximate physics functions.

problem Designing neural networks that respect physical symmetries.
method Parameterizing polynomial functions equivariant to various symmetries using scalars.
result Universal approximation of polynomial functions under various symmetries using scalars.

There are several types of equation of motion of elastic wires. In this paper, we treat an equation taking account of the thickness of wire. The equation was introduced by Caflisch and Maddocks on plane curves, and they proved the existence of solutions. Koiso and Sugimoto generalized the result to any dimensional Eucl…

2018-09-21abs ↗pdf ↗

We consider a quadratic form defined on the surfaces with parallel mean curvature vector of an any dimensional complex space form and prove that its (2,0)(2,0)-part is holomorphic. When the complex dimension of the ambient space is equal to 22 we define a second quadratic form with the same property and then determine th…

2010-11-25abs ↗pdf ↗

We present a new method for the separation of superimposed, independent, auto-correlated components from noisy multi-channel measurement. The presented method simultaneously reconstructs and separates the components, taking all channels into account and thereby increases the effective signal-to-noise ratio considerably…

2017-05-05abs ↗pdf ↗

PPI++ uses machine learning predictions to improve inference from small datasets.

problem Efficient inference from small labeled datasets with high-quality predictions.
method Adapts prediction-powered inference (PPI) to compute confidence sets for any parameter dimensionality.
result Improves classical intervals using only labeled data, always yielding better results.

In this paper we prove the infinitesimal uniqueness theorem for the Newton potential of non simply connected bodies using the singularity theory approach. We consider the Newtonian potentials of the domains in Rn{\bf R}^n boundaries of which are the vanishing cycles on the level hypersurface of a holomorphic function w…

2001-11-11abs ↗pdf ↗

Most data is multi-dimensional. Discovering whether any subset of dimensions, or subspaces, of such data is significantly correlated is a core task in data mining. To do so, we require a measure that quantifies how correlated a subspace is. For practical use, such a measure should be universal in the sense that it capt…

2015-10-28abs ↗pdf ↗

One approach for constructing copula functions is by multiplication. Given that products of cumulative distribution functions (CDFs) are also CDFs, an adjustment to this multiplication will result in a copula model, as discussed by Liebscher (J Mult Analysis, 2008). Parameterizing models via products of CDFs has some a…

2015-11-09abs ↗pdf ↗

Financial institutions now face the important challenge of having to do multiple portfolio revaluations for their risk computation. The list is almost endless: from XVAs to FRTB, stress testing programs, etc. These computations require from several hundred up to a few million revaluations. The cost of implementing thes…

2018-05-02abs ↗pdf ↗

Adaptive framework improves nonparametric dimensionality reduction.

problem Optimal hyper-parameter tuning for nonparametric dimensionality reduction.
method Adaptive framework using intrinsic dimension estimator and optimal local neighbourhood sizes.
result Significant improvements in various learning tasks through better low-dimensional visualizations.

Machine learning approximates Calabi-Yau Hodge numbers from weight systems.

problem Approximating Hodge numbers of Calabi-Yau manifolds from weight systems.
method Neural networks learned Hodge numbers from weight systems, symbolic regression inspired truncation, and machine learning generated new datasets.
result Approximation provides tight lower bounds and dramatically faster computation.

Unified method for input, data, and model uncertainty in neural networks.

problem Uncertainty in neural network inputs and outputs.
method Propagating uncertainty through inputs using a unified formulation.
result More stable decision boundaries with input noise, and propagation of input uncertainty to model outputs.

TVS-FNNs can approximate any continuous function on expanded input spaces.

problem Processing a broader range of inputs like sequences and matrices.
method Proving a universal approximation theorem for TVS-FNNs.
result TVS-FNNs can approximate any continuous function on expanded input spaces.

A new method builds sparse polynomial chaos expansions for models with dependent inputs.

problem Quantifying uncertainty in models with dependent inputs.
method Data-driven approach to construct orthonormal polynomials recursively based on input correlations.
result Reduces the number of observations and improves numerical stability and computational efficiency.

Centroid Transformers reduce memory and computation by summarizing inputs into centroids.

problem Efficiently summarize inputs with reduced memory and computation.
method Generalizes self-attention to map N inputs to M centroids (M ≤ N), reducing complexity.
result Centroid Transformers reduce memory and computation while preserving key information.

IA-BMA adapts model weights to inputs for better predictions.

problem Predicting with multiple models in heterogeneous settings.
method Input adaptive Bayesian Model Averaging (IA-BMA) with an input adaptive prior and amortized variational inference.
result IA-BMA consistently delivers more accurate and better-calibrated predictions.

Recent work establishes dataset difficulty and removes annotation artifacts via partial-input baselines (e.g., hypothesis-only models for SNLI or question-only models for VQA). When a partial-input baseline gets high accuracy, a dataset is cheatable. However, the converse is not necessarily true: the failure of a parti…

2019-05-14abs ↗pdf ↗

We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., εε-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse …

2018-11-30abs ↗pdf ↗

When simulating a complex stochastic system, the behavior of output response depends on input parameters estimated from finite real-world data, and the finiteness of data brings input uncertainty into the system. The quantification of the impact of input uncertainty on output response has been extensively studied. Most…

2015-07-21abs ↗pdf ↗

We present a novel framework for specifying and verifying correctness globally for neural networks on perception tasks. Most previous works on neural network verification for perception tasks focus on robustness verification. Unlike robustness verification, which aims to verify that the prediction of a network is stabl…

2019-06-03abs ↗pdf ↗

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.

SpinSVAR estimates SVAR models with sparse input, improving accuracy and scalability.

problem Estimating SVAR models with sparse input assumptions.
method SpinSVAR models input as independent Laplacian variables, enforcing sparsity and using least absolute error regression.
result SpinSVAR outperforms state-of-the-art methods in accuracy and runtime, identifying significant structural shocks.

New method distinguishes predictive distribution estimators in high-dimensional inputs.

problem Difficulty in evaluating predictive distributions for high-dimensional inputs.
method Introduces dyadic sampling to focus on predictive distributions associated with pairs of inputs.
result Demonstrates efficient distinction of predictive distribution estimators in high-dimensional examples.

This research analyzes how input and output layers affect deep neural networks' resistance to adversarial attacks.

problem The vulnerability of deep neural networks to adversarial inputs, especially non-gradient based attacks.
method Analysis of three different fully connected dense network classes with manipulated input and output layers.
result Manipulating input and output layers can significantly enhance a deep neural network's robustness against adversarial attacks.

Humans increasingly interact with Artificial intelligence(AI) systems. AI systems are optimized for objectives such as minimum computation or minimum error rate in recognizing and interpreting inputs from humans. In contrast, inputs created by humans are often treated as a given. We investigate how inputs of humans can…

2019-12-08abs ↗pdf ↗

New method certifies neural network robustness under random input noise.

problem Certifying neural network robustness against random input noise.
method Chance-constrained optimization problem reformulated with input-output samples, convex conditions developed.
result Proposed method certifies robustness against various input noise regimes over larger uncertainty regions.

In this work, we aim to solve data-driven optimization problems, where the goal is to find an input that maximizes an unknown score function given access to a dataset of inputs with corresponding scores. When the inputs are high-dimensional and valid inputs constitute a small subset of this space (e.g., valid protein s…

2019-12-31abs ↗pdf ↗