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

3774111148 · Jun 202019922001200920172026
48 results for noisy responses

New metric compares noisy neural trajectories using optimal transport.

problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.

Paper studies zero-sum games with noisy observations and identifies equilibrium conditions.

problem Zero-sum games with noisy observations of the leader's actions.
method Analyzes the equilibrium of games with noisy action observability, identifies necessary conditions for uniqueness, and investigates the cardinality of best responses.
result The noisy observations significantly impact the cardinality of the follower's set of best responses, and under certain conditions, this set becomes a singleton almost surely.

Bayes classifier cannot be learned from noisy labels without knowing noise distribution.

problem Learning a Bayes classifier from noisy labels when the noise distribution is unknown.
method Demonstrates the identifiability issues and proposes a simple algorithm for learning the Bayes decision rule.
result The Bayes decision rule is generally unidentified and cannot be learned without knowing the noise distribution.

Study learns linear utility functions from comparisons, showing learnability gaps between passive and active learning.

problem Learn linear utility functions from pairwise comparison queries.
method Analyzes passive and active learning settings, considering noise-free and noisy query responses.
result Efficient learnability of linear utilities in passive learning, but not for utility parameters without strong assumptions.

The paper introduces a frequency-domain estimator for low-order systems from noisy data.

problem Estimating frequency responses of low-order systems from noisy measurements.
method Uses a quadratic data-fitting term regularized by the nuclear norm of a Loewner matrix, subject to a convex stability constraint.
result Proves a finite-sample error bound and extends it to all frequencies through rational interpolation.

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

Adaptive batching improves Gaussian process surrogates for noisy level set estimation.

problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.

Ensemble unsupervised anomaly detection using IRT for hidden ground truth.

problem Challenges in constructing an ensemble from unsupervised anomaly detection methods.
method Use Item Response Theory to compute latent traits and construct an ensemble that downplays noisy methods.
result Demonstrated effectiveness of IRT ensemble on extensive data repository.

GATs improve node regression on noisy graphs with provable advantage.

problem Improving node regression on graphs with noisy covariates and edges.
method Proposes a GAT designed for denoising proxy features in node regression.
result GAT achieves lower error in estimating regression coefficient and predicting responses.

Study improves dynamic PT fleet optimization under noisy demand predictions.

problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.

We consider numerical schemes for root finding of noisy responses through generalizing the Probabilistic Bisection Algorithm (PBA) to the more practical context where the sampling distribution is unknown and location-dependent. As in standard PBA, we rely on a knowledge state for the approximate posterior of the root l…

2017-11-02abs ↗pdf ↗

The paper studies how noisy labels impact decision-making in machine learning.

problem The impact of noisy labels on decision-making in machine learning.
method Introducing a notion of regret, studying standard approaches, and estimating individual-level mistakes.
result Standard approaches can lead to unforeseen mistakes for individuals, revealing the need for anticipation.

Study tackles nonlinear factor models with unknown monotone links from incomplete and noisy data.

problem Learning nonlinear factor models with unknown monotone links from incomplete and noisy data.
method Formulated as joint recovery of low-rank factors, loadings, and nonlinear link function; proposed BCD algorithm with regularization.
result Established convergence guarantees and sublinear regret bounds for link-function updates.

We consider the problem of learning the nearest neighbor graph of a dataset of n items. The metric is unknown, but we can query an oracle to obtain a noisy estimate of the distance between any pair of items. This framework applies to problem domains where one wants to learn people's preferences from responses commonly …

2019-05-30abs ↗pdf ↗

New methods protect privacy while providing accurate prediction sets.

problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.

We propose methods for estimating correspondence between two point sets under the presence of outliers in both the source and target sets. The proposed algorithms expand upon the theory of the regression without correspondence problem to estimate transformation coefficients using unordered multisets of covariates and r…

2019-06-01abs ↗pdf ↗

Node-perturbation learning is a type of statistical gradient descent algorithm that can be applied to problems where the objective function is not explicitly formulated, including reinforcement learning. It estimates the gradient of an objective function by using the change in the object function in response to the per…

2017-06-20abs ↗pdf ↗

We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly nat…

2016-10-30abs ↗pdf ↗

Large batch training with DP-SGD reduces model performance due to implicit bias.

problem Large batch training with DP-SGD reduces model performance.
method The study analyzes the phenomenon of implicit bias in Noisy-SGD (DP-SGD without clipping) and its theoretical solutions for linear models.
result The implicit bias in large batch training with DP-SGD is amplified by additional noise, similar to SGD.

We develop a behavioral asset pricing model in which agents trade in a market with information friction. Profit-maximizing agents switch between trading strategies in response to dynamic market conditions. Due to noisy private information about the fundamental value, the agents form different evaluations about heteroge…

2018-02-11abs ↗pdf ↗

Accurately predicting drug responses to cancer is an important problem hindering oncologists' efforts to find the most effective drugs to treat cancer, which is a core goal in precision medicine. The scientific community has focused on improving this prediction based on genomic, epigenomic, and proteomic datasets measu…

2016-12-02abs ↗pdf ↗

Suppose that we wish to estimate a user's preference vector ww from paired comparisons of the form "does user ww prefer item pp or item qq?," where both the user and items are embedded in a low-dimensional Euclidean space with distances that reflect user and item similarities. Such observations arise in numerous se…

2019-05-10abs ↗pdf ↗

Unified Bayesian framework for LTV system identification using neural networks and Gaussian Processes.

problem Identifying Linear Time-Varying systems from input-output data.
method Bayesian modeling of impulse response as a stochastic process, using neural networks and Gaussian Processes for inference.
result Framework can infer LTI system properties from a single noisy input-output pair, achieving lower error than classical methods.

DASC combines social media and car sensors to improve disaster response.

problem Inconsistent reliability and inconsistent availability of human sensors.
method Hybrid social-car sensing system using game theory, feedback control, and MDP.
result DASC improves detection accuracy and efficiency in disaster response.

CausalRM models rewards from user feedback, overcoming noise and bias.

problem Aligning language models with user preferences from noisy, biased feedback.
method Causal-theoretic reward modeling framework addressing noise and bias in observational feedback.
result CausalRM learns accurate reward signals from noisy and biased observational feedback.

New algorithm tackles high-dimensional simulation optimization, converging efficiently.

problem High-dimensional simulation optimization challenges.
method Sparse grid experimental design combined with kernel ridge regression using Brownian field kernel, followed by expected improvement strategy.
result Established upper bounds on convergence rate, demonstrating superior performance in practice.

In this paper, we present an initial attempt to learn evolution PDEs from data. Inspired by the latest development of neural network designs in deep learning, we propose a new feed-forward deep network, called PDE-Net, to fulfill two objectives at the same time: to accurately predict dynamics of complex systems and to …

2017-10-26abs ↗pdf ↗

The seemingly stochastic transient dynamics of neocortical circuits observed in vivo have been hypothesized to represent a signature of ongoing stochastic inference. In vitro neurons, on the other hand, exhibit a highly deterministic response to various types of stimulation. We show that an ensemble of deterministic le…

2013-11-13abs ↗pdf ↗

New error bounds for noisy phase retrieval problems using empirical risk minimization.

problem Estimating signals in noisy phase retrieval problems.
method Empirical 2\ell_2 risk minimization (ERM) with new error bounds for different noise patterns.
result Established new error bounds for NPR and NGPR, showing improved performance under various noise conditions.