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

Trend · papers per month

2915818721,162 · Jun 202019922001200920172026
48 results for input generation

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.

In this paper, we propose a method that disentangles the effects of multiple input conditions in Generative Adversarial Networks (GANs). In particular, we demonstrate our method in controlling color, texture, and shape of a generated garment image for computer-aided fashion design. To disentangle the effect of input at…

2018-06-20abs ↗pdf ↗

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 ↗

This thesis investigates unsupervised time series representation learning for sequence prediction problems, i.e. generating nice-looking input samples given a previous history, for high dimensional input sequences by decoupling the static input representation from the recurrent sequence representation. We introduce thr…

2018-04-18abs ↗pdf ↗

New neural network models learn symmetric functions of varying input sizes.

problem Learning symmetric functions with varying input sizes.
method Functional perspective on neural networks, treating symmetric functions as functions over probability measures.
result Established approximation and generalization bounds for shallow architectures that extend across input sizes.

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 ↗

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

2019-04-09abs ↗pdf ↗

Generative adversarial networks benefit from optimal input dimension and adaptive generator architecture.

problem Minimizing generalization error in GANs through optimal input dimension.
method Introducing generalized GANs (G-GANs) with group penalty and architecture penalty for adaptive dimensionality reduction and network architecture identification.
result G-GANs achieve superior performance with 40%+ improvements in maximum mean discrepancy or Frechet inception distance compared to off-the-shelf methods.

Neural networks are vulnerable to adversarially-constructed perturbations of their inputs. Most research so far has considered perturbations of a fixed magnitude under some lpl_p norm. Although studying these attacks is valuable, there has been increasing interest in the construction of (and robustness to) unrestricted…

2019-05-07abs ↗pdf ↗

This research investigates reliable local explanations for machine listening models.

problem Generating reliable local explanations for machine listening models.
method Investigates the sensitivity of SoundLIME explanations to input perturbations and proposes a novel method for identifying suitable content types.
result SoundLIME explanations are sensitive to the content in occluded input regions, and the average magnitude of input mel-spectrogram bins is the most suitable content type for temporal explanations.

Model captures system input variations in latent space for actionable dynamics.

problem Learning dynamical systems from data without prescribing a mathematical model.
method Structured latent ODE model with stochastic factors of variation for each input.
result Improves generation of time-series data and inference of system inputs over baselines.

Traditionally, text generation models take in a sequence of text as input, and iteratively generate the next most probable word using pre-trained parameters. In this work, we propose the architecture to use images instead of text as the input of the text generation model, called StoryGen. In the architecture, we design…

2020-01-16abs ↗pdf ↗

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.

Study on VC dimension of GCNNs with input resolution effects.

problem Understanding the generalization capabilities of GCNNs.
method Derived upper and lower bounds for VC dimension, analyzed factors affecting it.
result Extended previous results on VC dimension of GCNNs, providing insights into input resolution dependence.

We propose a generative model for adversarial attack. The model generates subtle but predictive patterns from the input. To perform an attack, it replaces the patterns of the input with those generated based on examples from some other class. We demonstrate our model by attacking CNN on MNIST.

2019-11-25abs ↗pdf ↗

Generalizes Hoeffding's decomposition for dependent inputs under mild conditions.

problem Performing global sensitivity analysis on black-box models with dependent inputs.
method Proposes a novel framework based on probability theory, functional analysis, and combinatorics to handle dependencies.
result Any square-integrable, real-valued function of random elements with mild dependence assumptions can be uniquely additively decomposed.

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.

Proposes training neural networks to predict uncertainty for out-of-distribution inputs.

problem Poor uncertainty predictions for out-of-distribution inputs limit model robustness.
method Generates pseudo-inputs in low-density regions and trains a Bayesian framework.
result Yields robust and interpretable uncertainty predictions.

Safe active learning for time-series models with Gaussian processes.

problem Learning time-series models while respecting safety constraints.
method Employing Gaussian processes with a nonlinear exogenous input structure, the approach dynamically explores the input space to generate data for model learning.
result The approach effectively learns time-series models under safety constraints, as demonstrated in a technical application.

LLMs' explanations are often insufficient and vary with input distribution.

problem Evaluating the sufficiency of LLM explanations without predefined biases.
method Generalizing sufficiency to arbitrary explanations, using LLM's input beliefs, and introducing SCSuff metric.
result Explanation sufficiency can vary with input distribution and is weakly correlated with model size, accuracy, or output entropy.

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 ↗

Recurrent Neural Networks (RNNs) are among the most popular models in sequential data analysis. Yet, in the foundational PAC learning language, what concept class can it learn? Moreover, how can the same recurrent unit simultaneously learn functions from different input tokens to different output tokens, without affect…

2019-02-04abs ↗pdf ↗

ASADG improves data generation for accurate surrogate modeling of complex physical problems.

problem Training surrogate models on imbalanced data leads to inaccurate predictions.
method ASADG iteratively adds input data to improve the representation of the response manifold.
result ASADG generates more representative input data compared to LHS for better model accuracy.

Proposes a method to optimize budget allocation for collecting and analyzing streaming data.

problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.

While deep learning is remarkably successful on perceptual tasks, it was also shown to be vulnerable to adversarial perturbations of the input. These perturbations denote noise added to the input that was generated specifically to fool the system while being quasi-imperceptible for humans. More severely, there even exi…

2017-04-19abs ↗pdf ↗

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

We propose an input design method for a general class of parametric probabilistic models, including nonlinear dynamical systems with process noise. The goal of the procedure is to select inputs such that the parameter posterior distribution concentrates about the true value of the parameters; however, exact computation…

2019-03-06abs ↗pdf ↗

Proposes a new method to selectively access privileged information in reinforcement learning.

problem Selective compression of privileged information in reinforcement learning.
method Formulates a variational bandwidth bottleneck to decide stochastically whether to access privileged information.
result Improves generalization and reduces access to costly information in reinforcement learning experiments.

State-space systems generate probabilistic dependencies between inputs and outputs.

problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.

Neural networks are known to be vulnerable to adversarial examples, inputs that have been intentionally perturbed to remain visually similar to the source input, but cause a misclassification. It was recently shown that given a dataset and classifier, there exists so called universal adversarial perturbations, a single…

2017-08-17abs ↗pdf ↗

This paper demonstrates how Dropout can be used in Generative Adversarial Networks to generate multiple different outputs to one input. This method is thought as an alternative to latent space exploration, especially if constraints in the input should be preserved, like in A-to-B translation tasks.

2019-09-10abs ↗pdf ↗

Student-teacher learning improves generalization with noisy inputs.

problem Transfer knowledge from clean inputs to noisy inputs.
method Analyzes student-teacher learning using deep linear networks and experiments with nonlinear networks.
result Three factors are vital for success: zero training loss, teacher knowledge, and feature decomposition.

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 ↗

This research reverses feature visualization in neural networks to optimize for specific feature objectives.

problem The invertibility of feature visualization in neural networks is not well understood.
method The approach involves optimizing for the feature objective that generates the input used in feature visualization, using the gradient of a specific objective function.
result A closed-form solution is found to minimize the gradient, providing an alternative view on network sensitivity.