ContrastiveVI+ models CRISPR screens with noisy guide efficiency.
problem Noisy guide efficiency in CRISPR screens.
method Generative modeling framework that disentangles perturbation-induced from shared variations.
result ContrastiveVI+ better recovers perturbation-induced variations and identifies cells without edits.
Recently, deep models have been successfully applied in several applications, especially with low-level representations. However, sparse, noisy samples and structured domains (with multiple objects and interactions) are some of the open challenges in most deep models. Column Networks, a deep architecture, can succinctl…
Proposes DGCN with trajectory sampling for data-efficient policy search in MBRL.
problem Improving data efficiency in model-based reinforcement learning.
method Combines trajectory sampling and DGCN for uncertainty propagation in probabilistic world models.
result Improves sample-efficiency over other uncertainty propagation methods and probabilistic models.
Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.
problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.
This study uses ICL to efficiently generate robust confidence intervals for noisy regression tasks.
problem Uncertainty quantification for in-context learning in noisy regression tasks.
method Proposes a method based on conformal prediction to construct prediction intervals with guaranteed coverage.
result Conformal prediction with in-context learning (CP with ICL) achieves robust and scalable uncertainty estimates.
New method estimates chirp parameters robustly from noisy mixtures.
problem Estimating chirp parameters from noisy mixtures of higher-order polynomials.
method Modified Langevin Monte Carlo (LMC) with curvature guidance.
result CG-LMC algorithm reliably finds minimizer in low SNR regimes.
We consider the problem of learning the level set for which a noisy black-box function exceeds a given threshold. To efficiently reconstruct the level set, we investigate Gaussian process (GP) metamodels. Our focus is on strongly stochastic samplers, in particular with heavy-tailed simulation noise and low signal-to-no…
Paper proposes a novel policy distillation method for better order execution in noisy markets.
problem Effective order execution in noisy and imperfect market conditions.
method Policy distillation method to guide reinforcement learning towards optimal trading strategies.
result Significant improvements over various baselines in order execution.
Recently, deep models have had considerable success in several tasks, especially with low-level representations. However, effective learning from sparse noisy samples is a major challenge in most deep models, especially in domains with structured representations. Inspired by the proven success of human guided machine l…
Tackles dynamic subsurface flow via GAN with physical theory constraints.
problem Deep learning of dynamic subsurface flow with heterogeneous parameters.
method Theory-guided generative adversarial network (TgGAN) for PDEs.
result TgGAN predicts future subsurface flow responses robustly and efficiently.
GUIDE-VAE generates user-guided data with improved realism and performance.
problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.
Physen-Noise2Noise tackles defocus deblurring in low-light conditions with physics-guided self-supervised learning.
problem Defocus deblurring in low-light conditions with complex biased noise.
method Physics-guided self-supervised deblurring framework that leverages noisy multi-frame observations and a learnable noise bias parameter.
result Physen-Noise2Noise consistently outperforms state-of-the-art methods in defocus deblurring with complex biased noise.
CNT leverages noisy targets to guide model learning.
problem Learning from noisy or incomplete labels.
method Conditioning model on noisy targets at inference time.
result Model focuses on simpler sub-problems and learns from easier examples first.
Interactive machine learning improves learning efficiency with user input.
problem Expensive, time-consuming, or risky acquisition of labeled data and decision-making.
method Develops new algorithms for active learning, sequential decision making, and model selection under partial feedback.
result First efficient algorithms achieving exponential label savings and independent of action space size.
A new method uses LLMs to discover causal pathways that affect fairness in machine learning.
problem Discovering fairness-relevant causal pathways in the presence of noise and confounding.
method Hybrid LLM-guided causal discovery framework combining active learning and dynamic scoring.
result LLM-guided methods, including the proposed active, dynamically scored variant, outperform baselines in recovering fairness-relevant structure under noisy conditions.
This work proposes a hybrid method for error detection in noisy Knowledge Graphs.
problem Error detection in noisy Knowledge Graphs.
method Hybrid and modular approach combining path ranking and representation learning.
result Hybrid method outperforms individual methods on benchmarks and real-world dataset.
SelectMix improves deep learning robustness against noisy labels.
problem Deep neural networks memorize noisy labels, degrading performance.
method Confidence-guided targeted sample mixing with soft labels.
result SelectMix consistently outperforms baseline methods on noisy label datasets.
Scarcity of labeled data is a bottleneck for supervised learning models. A paradigm that has evolved for dealing with this problem is data programming. An existing data programming paradigm allows human supervision to be provided as a set of discrete labeling functions (LF) that output possibly noisy labels to input in…
Efficiently quantifies uncertainty in subsurface flow using neural networks guided by theory.
problem Uncertainty in dynamic subsurface flow predictions.
method Theory-guided Neural Network (TgNN) for efficient uncertainty quantification.
result TgNN surrogate improves efficiency of uncertainty quantification compared to MC method.
PGAE uses predictions to guide active experimentation.
problem Efficiently guiding experimental sampling based on predictions.
method PGAE framework that combines predictions and actual outcomes.
result PGAE achieves asymptotic optimality and efficiency.
GSI improves efficiency of large language model inference.
problem Efficiently guiding test-time alignment in large language models.
method Combines soft best-of-n scaling with a reward model and speculative samples. result Achieves higher accuracy and reduced latency compared to standard methods.
To realize efficient computational fluid dynamics (CFD) prediction of two-phase flow, a multi-scale framework was proposed in this paper by applying a physics-guided data-driven approach. Instrumental to this framework, Feature Similarity Measurement (FSM) technique was developed for error estimation in two-phase flow …
New acquisition function for extreme rewards in bandits.
problem Online decision making with extreme payoffs in multi-armed bandits.
method Modeling payoffs as Gaussian processes and using a novel UCB acquisition function.
result Demonstrated benefits across synthetic and real-world benchmarks.
BOKE optimizes expensive functions with reduced computational costs.
problem High computational cost of Gaussian process-based Bayesian optimization.
method Kernel regression and density-based exploration integrated into confidence bounds.
result BOKE achieves global convergence and superior computational efficiency.
FinReflectKG benchmarks financial QA by linking relevant context from a financial KG, improving model performance and efficiency.
problem Efficiently retrieving and navigating relevant financial information across diverse sources and years.
method A benchmark built on a temporally indexed financial KG, generating QA pairs via pattern-specific prompts and quality control, evaluating retrieval scenarios.
result KG-guided retrieval yields substantial gains in correctness and token utilization, improving model performance by 24%.
Improved GSPGS estimators reduce bias in noisy function measurements.
problem Reduced bias in noisy function measurements.
method Generalized Simultaneous Perturbation-based Gradient Search (GSPGS) with various estimators.
result Estimators requiring more function measurements have lower bias.
TGD improves conditional sampling by concentrating computation on promising trajectories.
problem Efficiently training-free conditional sampling with diffusion priors.
method Tempered Guided Diffusion (TGD) using annealed sequential Monte Carlo.
result TGD yields a consistent particle approximation to the posterior as the number of particles grows.
Study efficient graph optimization with noisy data.
problem Optimizing functions on graphs with noisy observations.
method Best-arm identification and simulated annealing variants.
result Near-optimal solutions found with small query numbers.
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…
We study the value of information in sequential compressed sensing by characterizing the performance of sequential information guided sensing in practical scenarios when information is inaccurate. In particular, we assume the signal distribution is parameterized through Gaussian or Gaussian mixtures with estimated mean…
GBOC detects anomalies in time series data using granular-ball vectors.
problem Challenges in modeling normal behavior in dynamic, nonlinear time series data.
method Granular-ball Vector Data Description (GVDD) and Granular-ball One-Class Network (GBOC).
result GBOC improves anomaly detection in time series data.
A new particle filter uses diffusion models to improve state estimation from noisy data.
problem Sequentially estimating the state of a dynamical system from noisy and incomplete observations.
method Uses a diffusion model to simulate and predict system dynamics, incorporating noisy observations to refine predicted states.
result An unbiased particle filtering method that rigorously fuses observational data with diffusion model simulations.
In many domains, collecting sufficient labeled training data for supervised machine learning requires easily accessible but noisy sources, such as crowdsourcing services or tagged Web data. Noisy labels occur frequently in data sets harvested via these means, sometimes resulting in entire classes of data on which learn…
Study reveals efficient recovery of multi-modal signals via Bayesian methods and sequential learning.
problem Recovering multiple high-dimensional signals from correlated modalities.
method Bayesian Approximate Message Passing and Sequential Curriculum Learning.
result Sequential learning strategy optimally recovers weak signals in multi-modal settings.
AlphaCFG discovers alpha factors using grammar-guided search.
problem Discovering formulaic alpha factors in finance.
method AlphaCFG uses a grammar-based framework to define and discover alpha factors with syntactic and semantic constraints.
result AlphaCFG outperforms state-of-the-art methods in trading profitability and efficiency.
Gradient-guided nested sampling improves posterior inference efficiency.
problem Efficiently sampling from complex posterior distributions.
method Gradient-guided nested sampling combining differentiable programming, Hamiltonian slice sampling, clustering, mode separation, dynamic nested sampling, and parallelization.
result Significantly faster mode discovery and more accurate partition function estimates.
Short-term demand forecasting models commonly combine convolutional and recurrent layers to extract complex spatiotemporal patterns in data. Long-term histories are also used to consider periodicity and seasonality patterns as time series data. In this study, we propose an efficient architecture, Temporal-Guided Networ…
Given a knowledge base or KB containing (noisy) facts about common nouns or generics, such as "all trees produce oxygen" or "some animals live in forests", we consider the problem of inferring additional such facts at a precision similar to that of the starting KB. Such KBs capture general knowledge about the world, an…
Paper improves ℓ0-SSC for noisy data by proving SDP and proposing Noisy-DR-ℓ0-SSC.
problem Noisy data and less restrictive subspace affinity in sparse subspace clustering.
method Proposes Noisy-DR-ℓ0-SSC, which projects data onto a lower dimensional space and then applies noisy ℓ0-SSC. result Theoretical guarantee on the correctness of noisy ℓ0-SSC in terms of SDP on noisy data. In this paper, we focus on weakly supervised learning with noisy training data for both classification and regression problems.We assume that the training outputs are collected from a mixture of a target and correlated noise distributions.Our proposed method simultaneously estimates the target distribution and the qual…
Deep neural networks have been proved efficient for medical image denoising. Current training methods require both noisy and clean images. However, clean images cannot be acquired for many practical medical applications due to naturally noisy signal, such as dynamic imaging, spectral computed tomography, arterial spin …
Efficiently samples posterior distributions using Langevin dynamics.
problem Challenges in generating diverse posterior samples in high-dimensional spaces.
method Simulates Langevin dynamics in the noise space of a pre-trained generative model.
result Noise-space Langevin dynamics approximates the posterior without restarting the full sampling chain.
Diffusion models tackle noisy inverse problems with posterior sampling.
problem Efficiently solving general noisy inverse problems.
method Approximation of posterior sampling for diffusion models.
result Diffusion models can handle various noise statistics and nonlinear problems.
We propose a novel direction to improve the denoising quality of filtering-based denoising algorithms in real time by predicting the best filter parameter value using a Convolutional Neural Network (CNN). We take the use case of BM3D, the state-of-the-art filtering-based denoising algorithm, to demonstrate and validate…
Efficiently clusters noisy data with minimal queries.
problem Clustering elements with noisy oracle feedback.
method Combination of sampling strategy and correlation clustering algorithm.
result First polynomial-time algorithms for NP-hard optimization problem.
VBMC+VIQR outperforms noisy models in Bayesian inference.
problem Bayesian inference with noisy likelihoods in complex models.
method Gaussian process surrogates, expected information gain, variational interquantile range.
result VBMC+VIQR achieves state-of-the-art performance in noisy inference benchmarks.
We present an interactive version of an evidence-driven state-merging (EDSM) algorithm for learning variants of finite state automata. Learning these automata often amounts to recovering or reverse engineering the model generating the data despite noisy, incomplete, or imperfectly sampled data sources rather than optim…
This paper tackles learning Stackelberg equilibrium in asymmetric games efficiently from noisy samples.
problem Learning Stackelberg equilibrium in asymmetric, general-sum games efficiently from noisy samples.
method The paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in bandit feedback setting.
result Sharp positive results on sample-efficient learning of Stackelberg equilibrium with value optimal up to a fundamental gap identified.