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

129259388517 · Jun 202019922001200920172026
48 results for multiple inputs

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.

MultiImport infers node importance from multiple KG signals.

problem Inferring node importance in a knowledge graph from multiple input signals.
method End-to-end latent variable model using attentive graph neural networks.
result MultiImport consistently outperforms existing methods, achieving up to 23.7% higher NDCG@100.

Develops a framework to quantify uncertainties in multiple ML models.

problem Uncertainty in ML model predictions and model inputs.
method Develops a theoretical framework to decouple and transform uncertainties.
result Generates joint distribution of ML predictions considering uncertainties.

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 ↗

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.

Efficient optimisation of black-box problems that comprise both continuous and categorical inputs is important, yet poses significant challenges. We propose a new approach, Continuous and Categorical Bayesian Optimisation (CoCaBO), which combines the strengths of multi-armed bandits and Bayesian optimisation to select …

2019-06-20abs ↗pdf ↗

Aims to optimize complex multivariate systems with constraints.

problem Optimizing force-field systems in physics with large-scale simulations.
method Combines machine learning and experimental design to find feasible input combinations.
result Locates multiple good regions in the input space.

We introduce a new regression framework, Gaussian process regression networks (GPRN), which combines the structural properties of Bayesian neural networks with the non-parametric flexibility of Gaussian processes. This model accommodates input dependent signal and noise correlations between multiple response variables,…

2011-10-19abs ↗pdf ↗

Adversarial Training (AT) and Virtual Adversarial Training (VAT) are the regularization techniques that train Deep Neural Networks (DNNs) with adversarial examples generated by adding small but worst-case perturbations to input examples. In this paper, we propose xAT and xVAT, new adversarial training algorithms, that …

2019-12-04abs ↗pdf ↗

This paper improves prediction accuracy for multi-input classification tasks using p-value aggregation.

problem Generating accurate predictive sets with guaranteed coverage for multi-input classification tasks.
method Integrates p-values from each observation to reduce the size of the predicted label set while maintaining class-conditional coverage.
result The method reduces the size of the predicted label set while preserving the required coverage guarantee.

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 ↗

Mixtures of experts probabilistically divide the input space into regions, where the assumptions of each expert, or conditional model, need only hold locally. Combined with Gaussian process (GP) experts, this results in a powerful and highly flexible model. We focus on alternative mixtures of GP experts, which model th…

2019-05-30abs ↗pdf ↗

In this paper, we consider parameter recovery for non-overlapping convolutional neural networks (CNNs) with multiple kernels. We show that when the inputs follow Gaussian distribution and the sample size is sufficiently large, the squared loss of such CNNs is  locally strongly convex\mathit{~locally~strongly~convex} in a basin of attraction…

2017-11-08abs ↗pdf ↗

Detects adversarial inputs in deep learning models without modifying the main network.

problem Vulnerability of deep learning models to adversarial inputs.
method Augment main network with observer networks that classify inputs as clean or adversarial.
result 99.5% detection accuracy on MNIST and 97.5% on CIFAR-10 datasets.

Tree-based algorithm for functional data analysis reduces generalization error.

problem Classification and regression problems with functional data.
method Constrained convex optimization for weighted functional L2L^{2} space, multiple splitting rules, and weighted integral features.
result Reduces generalization error while maintaining interpretability.

A key challenge in developing and deploying Machine Learning (ML) systems is understanding their performance across a wide range of inputs. To address this challenge, we created the What-If Tool, an open-source application that allows practitioners to probe, visualize, and analyze ML systems, with minimal coding. The W…

2019-07-09abs ↗pdf ↗

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

2018-02-13abs ↗pdf ↗

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.

The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries of the image domain. In comparison, there are a number of problems in which the…

2016-12-14abs ↗pdf ↗

The paper explains DNNs by quantifying interactions among input variables.

problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.

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 ↗

LLM-as-a-service prices vary arbitrarily due to tokenization multiplicity.

problem Arbitrary price variation in LLM-as-a-service due to multiple tokenizations of the same output.
method Introduce canonical generation to restrict LLMs to unique tokenizations and develop an efficient sampling algorithm.
result Our sampling algorithm for canonical generation solves tokenization multiplicity and maintains comparable performance and runtime to standard sampling.

In kernel methods, temporal information on the data is commonly included by using time-delayed embeddings as inputs. Recently, an alternative formulation was proposed by defining a gamma-filter explicitly in a reproducing kernel Hilbert space, giving rise to a complex model where multiple kernels operate on different t…

2017-06-12abs ↗pdf ↗

Privacy-preserving machine learning methods add randomness, leading to varying predictions.

problem Privacy-preserving machine learning methods add randomness, leading to varying predictions.
method The study analyzes three DP-ensuring algorithms: output perturbation, objective perturbation, and DP-SGD.
result The degree of predictive multiplicity rises as the level of privacy increases, and is unevenly distributed across individuals and demographic groups.

The class of Gaussian Process (GP) methods for Temporal Difference learning has shown promise for data-efficient model-free Reinforcement Learning. In this paper, we consider a recent variant of the GP-SARSA algorithm, called Sparse Pseudo-input Gaussian Process SARSA (SPGP-SARSA), and derive recursive formulas for its…

2018-11-17abs ↗pdf ↗

Multimodal learning with deep Boltzmann machines (DBMs) is an generative approach to fuse multimodal inputs, and can learn the shared representation via Contrastive Divergence (CD) for classification and information retrieval tasks. However, it is a 2-fan DBM model, and cannot effectively handle multiple prediction tas…

2015-03-26abs ↗pdf ↗

Quantum reservoir computing needs coherence influx for effective information processing.

problem Understanding and optimizing quantum reservoir computing.
method Theoretical and numerical analysis of quantum systems, focusing on coherence influx and spectral radius of Pauli transfer matrix.
result Coherence influx is essential for realizing nonstationary echo state property in quantum reservoir computing.

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.

The paper introduces a method for learning nonparametric Volterra kernels using Gaussian processes.

problem Learning nonparametric nonlinear operators from data.
method NVKM model using Volterra series and Gaussian processes for unobserved and observed input functions.
result The NVKM model can perform both single and multiple output regression and system identification.

We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and def…

2015-08-04abs ↗pdf ↗

Paper introduces uncertainty injection for deep learning robust optimization.

problem Uncertainty in input data affects deep learning model performance in optimization problems.
method Uncertainty injection scheme for training deep learning models to produce robust solutions.
result Proposed scheme improves robustness of solutions in wireless communications applications.

In this paper, the echo state network (ESN) memory capacity, which represents the amount of input data an ESN can store, is analyzed for a new type of deep ESNs. In particular, two deep ESN architectures are studied. First, a parallel deep ESN is proposed in which multiple reservoirs are connected in parallel allowing …

2019-06-11abs ↗pdf ↗