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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Input-Output Maps

TCNs can approximate complex input-output maps with limited memory.

problem Approximating complex input-output maps with limited memory.
method Proved TCNs can approximate a wide class of input-output maps with arbitrary error tolerance.
result Deep ReLU TCNs can approximate input-output maps with finite memory to arbitrary error.

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

Recent advances in machine learning and artificial intelligence are now being considered in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains are currently unable to provide convincing arguments that their systems are saf…

2019-05-10abs ↗pdf ↗

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.

Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.

problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.

We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are it…

2016-11-08abs ↗pdf ↗

Neural Processes (NPs) (Garnelo et al 2018a;b) approach regression by learning to map a context set of observed input-output pairs to a distribution over regression functions. Each function models the distribution of the output given an input, conditioned on the context. NPs have the benefit of fitting observed data ef…

2019-01-17abs ↗pdf ↗

Economic systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD) is one of the first efforts to construct the multi-regional input-output (MRIO) tables at the global level. By viewing t…

2014-07-01abs ↗pdf ↗

Wasserstein Neural Processes improve traditional NPs by using Wasserstein distance.

problem Traditional NPs fail to learn reasonable distributions for certain problem classes.
method Use approximations of Wasserstein distance to overcome limitations of KL divergence.
result Wasserstein Neural Processes maintain benefits of traditional NPs while approximating new function mappings.

Tensor completion method identifies nonlinear systems from input-output data.

problem Identifying nonlinear functions from input-output data pairs.
method Formulated as tensor completion problem with smoothness regularization and solved using block coordinate descent.
result Provable correct nonlinear system identification under certain conditions.

The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a global minimizer of the error. Previous work showed that a global solution could b…

2015-09-08abs ↗pdf ↗

Method combines clustering and matrix completion for missing data in I/O tables.

problem Reconstructing missing entries in World Input-Output (I/O) matrices due to data collection issues.
method Hierarchical clustering and Matrix Completion with LASSO-like nuclear norm penalty.
result The method effectively predicts missing values from previous and similar countries' data.

We introduce a data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space where ba…

2011-08-14abs ↗pdf ↗

A method constructs a stochastic surrogate from dimensionality reduction results for high-dimensional uncertainty quantification.

problem High-dimensional uncertainty quantification with physics-based models.
method Constructs a stochastic surrogate model from dimensionality reduction results.
result Preserves convenience of sequential dimensionality reduction and Gaussian process regression while overcoming limitations.

New method ranks sectors and countries using local and aggregate I-O data.

problem Ranking sectors and countries in global value chains using incomplete I-O tables.
method Rank-11 approximation to I-O tables using local and aggregate information.
result Consistently good performance in reconstructing rankings of upstreamness and downstreamness.

Different neural networks trained on the same dataset often learn similar input-output mappings with very different weights. Is there some correspondence between these neural network solutions? For linear networks, it has been shown that different instances of the same network architecture encode the same representatio…

2018-11-28abs ↗pdf ↗

We consider the problem of learning a realization for a linear time-invariant (LTI) dynamical system from input/output data. Given a single input/output trajectory, we provide finite time analysis for learning the system's Markov parameters, from which a balanced realization is obtained using the classical Ho-Kalman al…

2018-06-14abs ↗pdf ↗

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

Spike-and-Slab Deep Learning (SS-DL) is a fully Bayesian alternative to Dropout for improving generalizability of deep ReLU networks. This new type of regularization enables provable recovery of smooth input-output maps with unknown levels of smoothness. Indeed, we show that the posterior distribution concentrates at t…

2018-03-24abs ↗pdf ↗

The original problem of supervised classification considers the task of automatically assigning objects to their respective classes on the basis of numerical measurements derived from these objects. Classifiers are the tools that implement the actual functional mapping from these measurements---also called features or …

2017-10-25abs ↗pdf ↗

Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested ifthenelseif-then-else questions, the testing nodes, leading to a set of predictions, th…

2017-04-26abs ↗pdf ↗

Optimal intervention in economic networks modeled as influence maximization, with hard computational problems.

problem Optimal intervention in economic networks modeled as influence maximization.
method Transformed into influence maximization-like form, with theoretical and practical implications.
result Optimal intervention is NP-hard and cannot be approximated to a constant factor in polynomial time.

The paper finds a surprising positive correlation between upstreamness and downstreamness in global value chains.

problem The puzzling positive correlation between upstreamness and downstreamness in industries and countries.
method Analysis of a simple model of random Input/Output tables and experiments on empirical data.
result Upstreamness and downstreamness of the same industrial sector/country are positively correlated with a slope close to +1.