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

245490735980 · Jun 202019922001200920172026
48 results for set input

This paper uses NARX neural networks for macroeconomic forecasting and goal setting.

problem Improving accuracy in macroeconomic forecasting and goal setting.
method Literature review and construction of specific NARX neural networks for macroeconomic indicators.
result NARX neural networks can be trained to make accurate predictions for macroeconomic indicators and national goals.

We propose a practical Bayesian optimization method over sets, to minimize a black-box function that takes a set as a single input. Because set inputs are permutation-invariant, traditional Gaussian process-based Bayesian optimization strategies which assume vector inputs can fall short. To address this, we develop a B…

2019-05-23abs ↗pdf ↗

In this chapter we take a look at the universal approximation question for stochastic feedforward neural networks. In contrast to deterministic networks, which represent mappings from a set of inputs to a set of outputs, stochastic networks represent mappings from a set of inputs to a set of probability distributions o…

2019-10-22abs ↗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.

The paper develops GP classifiers for noisy inputs in multi-class classification.

problem Input noise in real-world data affects supervised learning performance.
method Developed multi-class Gaussian Process classifiers using variational inference.
result The proposed methods outperform noise-ignoring GP classifiers in predictive distribution.

Bayesian method for estimating inputs leading to specific probability outputs.

problem Estimating inputs for specific probability outputs of uncertain functions.
method Bayesian strategy using Gaussian process modeling and SUR principle.
result Surpassed performance of existing methods through numerical experiments.

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

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 ↗

Testing Deep Neural Network (DNN) models has become more important than ever with the increasing usage of DNN models in safety-critical domains such as autonomous cars. The traditional approach of testing DNNs is to create a test set, which is a random subset of the dataset about the problem of interest. This kind of a…

2019-11-24abs ↗pdf ↗

Simplified DGPs training by fixing inducing inputs to subset of data.

problem Challenging training of deep Gaussian processes.
method Fixed subset of data for inducing inputs, variational sampling.
result Significant reduction in trainable parameters and computation cost without performance degradation.

Fairness is a critical trait in decision making. As machine-learning models are increasingly being used in sensitive application domains (e.g. education and employment) for decision making, it is crucial that the decisions computed by such models are free of unintended bias. But how can we automatically validate the fa…

2018-07-02abs ↗pdf ↗

In some reinforcement learning problems an agent may be provided with a set of input policies, perhaps learned from prior experience or provided by advisors. We present a reinforcement learning with policy advice (RLPA) algorithm which leverages this input set and learns to use the best policy in the set for the reinfo…

2013-05-05abs ↗pdf ↗

MIMONets speed up neural network inference by processing multiple inputs in parallel.

problem Reducing computational cost in neural network inference for large datasets.
method Proposes MIMONets, which augment neural network architectures with variable binding mechanisms to handle multiple inputs in superposition.
result Achieves significant speedups (2-4x) with minimal accuracy loss, demonstrating adaptability across different architectures.

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.

This paper studies the generalization error of invariant classifiers. In particular, we consider the common scenario where the classification task is invariant to certain transformations of the input, and that the classifier is constructed (or learned) to be invariant to these transformations. Our approach relies on fa…

2016-10-14abs ↗pdf ↗

Recently, it has been shown that many functions on sets can be represented by sum decompositions. These decompositons easily lend themselves to neural approximations, extending the applicability of neural nets to set-valued inputs---Deep Set learning. This work investigates a core component of Deep Set architecture: ag…

2019-03-18abs ↗pdf ↗

The paper explores how benign overfitting occurs in heavy-tailed input distributions.

problem Understanding overfitting in heavy-tailed input distributions.
method Analysis of maximum margin classifiers on unregularized logistic loss with gradient descent.
result Linear classifiers trained under certain conditions can asymptotically achieve the noise level as misclassification error.

New methods improve uncertainty explanations for models.

problem Improving interpretation of uncertainty estimates from probabilistic models.
method Developed new methods to generate diverse and global explanations for uncertain model predictions.
result Generated diverse and global explanations for uncertain model predictions, addressing previous limitations.

A new approach to sensitivity analysis without the Sobol decomposition.

problem Traditional sensitivity indices like Sobol indices have limitations.
method Introducing sensitivity measures that generalize existing indices and define interaction effects.
result Sensitivity measures can create new indices and define interaction effects.

In-N-Out improves model robustness to out-of-distribution data.

problem Learning robust models with few in-distribution labeled examples.
method Pre-training with auxiliary information and self-training with pseudolabels.
result In-N-Out outperforms auxiliary inputs or outputs alone on both in-distribution and OOD error.

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.

Functional input neural networks approximate continuous functions on weighted spaces.

problem Approximating continuous functions on infinite-dimensional weighted spaces.
method Additive family mapping, non-linear activation, linear readouts, Stone-Weierstrass theorem.
result Global universal approximation of continuous functions on weighted spaces.

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.

Programming by example is the problem of synthesizing a program from a small set of input / output pairs. Recent works applying machine learning methods to this task show promise, but are typically reliant on generating synthetic examples for training. A particular challenge lies in generating meaningful sets of inputs…

2019-11-06abs ↗pdf ↗

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

DAEGEN generates adversarial inputs for neural networks using a black-box differential technique.

problem Generating adversarial inputs that highlight differences between neural network models.
method DAEGEN uses a local search-based optimization algorithm to find difference-inducing adversarial examples (DIAEs).
result DAEGEN is the first black-box differential technique for adversarial input generation and performs well compared to existing methods.

We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree rr polynomial which depends on at most kk inputs, counting at most \ell monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns w…

2017-09-28abs ↗pdf ↗

We consider the problem of classification when inputs correspond to sets of vectors. This setting occurs in many problems such as the classification of pieces of mail containing several pages, of web sites with several sections or of images that have been pre-segmented into smaller regions. We propose generalizations o…

2011-03-25abs ↗pdf ↗

New BO method optimizes multiple objectives under input noise.

problem Optimizing multiple performance metrics in manufacturing processes subject to random input noise.
method Formalizes optimization of multivariate value-at-risk (MVaR) using random scalarizations.
result Significantly outperforms alternative methods in identifying robust designs.