New approach to robustly reliable learners against instance-targeted attacks.
problem Addressing data poisoning attacks on robustly reliable learners.
method Defining regularized robustly reliable learners and efficient algorithms.
result Efficient algorithms for robustly reliable learners with sublinear runtime.
Adversarially trained transformers can learn robustly across tasks with minimal tuning.
problem Adversarial attacks and the high cost of adversarial training.
method Adversarial pretraining followed by in-context learning.
result Single-layer linear transformers can generalize robustly to unseen tasks.
F-PACOH improves meta-learners' reliability in uncertain regions.
problem Overconfident uncertainty estimates in meta-learning.
method Meta-learning priors as stochastic processes in function space, directly steering predictions towards high epistemic uncertainty.
result Significantly outperforms other meta-learners in Bayesian Optimization.
Proposes a method to integrate learner models robustly against misspecifications.
problem Misspecifications in learner models and parameter sharing patterns degrade prediction accuracy.
method Sequentially incorporates additional learners based on user-specified parameter sharing patterns.
result Data-adaptively selects the most suitable way of parameter sharing to enhance predictive performance.
New minimax optimal learner for robust predictors against adversarial examples.
problem Learning robust predictors against adversarial examples.
method Global perspective and new algorithmic ideas.
result Characterizes classes of predictors that are robustly learnable.
A scalable method for heavy-tailed data using robust aggregation.
problem Scalability issues with robust gradient descent under heavy-tailed data.
method Robustly choosing a strong candidate from parallel sub-processes.
result Improved scalability with robustness to perturbations.
Algorithm learns binary function efficiently under arbitrary covariate shift.
problem Learning binary function under arbitrary distributions P and Q.
method PQ-learning algorithm using reliable learner with selective classification.
result Polynomial-time algorithm for covariate shift learning.
Computational limitations require more model parameters for robust learning.
problem Computational constraints affect the number of parameters needed for robust learning.
method Analyzes computational limitations and their impact on model size for robust learning.
result Computational bounded learners need significantly more parameters for robust learning.
Meta-learner estimates heterogeneous DiD effects robustly.
problem Estimating heterogeneous treatment effects in panel data with DiD.
method Doubly robust meta-learner for CATT, using convex risk minimization and auxiliary models.
result Superior performance over existing methods in empirical tests.
We consider the problem of learning causal relationships from relational data. Existing approaches rely on queries to a relational conditional independence (RCI) oracle to establish and orient causal relations in such a setting. In practice, queries to a RCI oracle have to be replaced by reliable tests for RCI against …
Debiased learners estimate heterogeneous treatment effects in observational studies.
problem Estimating heterogeneous treatment effects in observational studies with unmeasured confounders.
method Debiased Front-Door (FD) learners, FD-DR-Learner and FD-R-Learner, under specific assumptions.
result Debiased learners satisfy error bounds and stage-error decompositions, delivering reliable HTE estimates.
Meta learning can adapt fast but is vulnerable to adversarial attacks.
problem Vulnerability of meta learning to adversarial attacks.
method Formal definition of adversarial attacks unique to meta learning, proposing an attacking algorithm.
result Meta learning is vulnerable to adversarial attacks.
In unsupervised ensemble learning, one obtains predictions from multiple sources or classifiers, yet without knowing the reliability and expertise of each source, and with no labeled data to assess it. The task is to combine these possibly conflicting predictions into an accurate meta-learner. Most works to date assume…
We propose a meta-learning algorithm utilizing a linear transformer that carries out null-space projection of neural network outputs. The main idea is to construct an alternative classification space such that the error signals during few-shot learning are quickly zero-forced on that space so that reliable classificati…
SLEM uses machine learning to improve causal inference from observational data.
problem Improving causal inference from observational data using non-linear relationships.
method Super Learner Equation Modeling integrating machine learning ensembles.
result SLEM provides consistent and unbiased estimates of causal effects.
Two new ensemble methods improve CATE estimation across various scenarios.
problem Estimating CATE in clinical trials to understand treatment effects heterogeneity.
method Proposed two ensemble methods: Stacked X-Learner and Consensus Based Averaging (CBA).
result Ensemble methods achieve good performance across diverse scenarios.
End-to-end autonomous driving models get better uncertainty estimates.
problem Uncertainty quantification for end-to-end autonomous driving models.
method Approximate inference for implicit copula neural linear model.
result Densities for steering angle are marginally calibrated.
New algorithms learn from comparisons to classify data robustly to noise.
problem Learning robust classifiers from noisy data efficiently.
method Introducing comparison queries to active learning, providing noise-tolerant classifiers.
result First time and query efficient algorithms for robust learning under bounded noise.
We address the problem of necessary conditions and topological obstructions for the existence of robustly transitive maps on surfaces. Concretely, we show that partial hyperbolicity is a necessary condition in order to have C1 robustly transitive endomorphisms with critical points on surfaces, and the only surfaces …
PowRL uses RL to manage power grids robustly, reducing overloads and maintaining power reliability.
problem Managing transient stability and preventing blackouts in power networks with uncertain generation and load demands.
method PowRL leverages a novel heuristic for overload management and RL-guided topology selection to ensure safe and reliable operation.
result PowRL outperforms other agents in L2RPN challenges, demonstrating robust performance in various scenarios.
Novel method to quantify aleatoric uncertainty of treatment effects from observational data.
problem Understanding randomness in treatment effects for medical treatments.
method Partial identification and Neyman-orthogonality to quantify aleatoric uncertainty.
result Developed a novel orthogonal learner (AU-learner) for quantifying aleatoric uncertainty.
New model predicts links in community-based networks robustly.
problem Link prediction in community-based networks with local clustering errors.
method Markov Stochastic Block Model (MSBM) with Hidden Markov Model (HMM) predictions.
result Misclassification error decays exponentially with relevant signal-to-noise ratio (SNR).
BoostForest combines multiple BoostTree models for improved accuracy.
problem Improving ensemble learning performance.
method BoostTree uses gradient boosting and random cut-points. BoostForest bootstraps training data and randomly samples parameters.
result BoostForest outperforms classical ensemble methods on 35 datasets.
Framework detects brain tumors robustly from MRI images.
problem Low clinical incidence of brain tumor cases makes diagnosis challenging.
method YOLOv8n for detection, DeiT for classification, PTP metric for evaluation.
result F1-score of 0.92 achieved with reduced computational resources.
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.
Paper proposes new γ-regret measure for non-episodic RL.
problem Measuring performance in non-episodic RL environments.
method Introduces γ-regret as a new performance measure and derives bounds. result Closed the gap between lower and upper bounds for γ-regret. New learning algorithm for heavy-tailed data using CVaR.
problem Learning with potentially heavy-tailed losses.
method Estimator of CVaR for heavy-tailed data, robust learning algorithm.
result High-probability excess CVaR bounds and empirical tests.
SFS-DA method statistically tests FS reliability under domain adaptation.
problem Feature selection reliability under domain adaptation with limited target data.
method Selective Inference framework to control false positive rate and enhance true positive rate.
result SFS-DA method controls FPR below a pre-specified level α (e.g., 0.05) while maximizing true positive rate. We study the question of learning an adversarially robust predictor. We show that any hypothesis class H with finite VC dimension is robustly PAC learnable with an improper learning rule. The requirement of being improper is necessary as we exhibit examples of hypothesis classes H with finite VC…
Deep reinforcement learning has learned to play many games well, but failed on others. To better characterize the modes and reasons of failure of deep reinforcement learners, we test the widely used Asynchronous Actor-Critic (A2C) algorithm on four deceptive games, which are specially designed to provide challenges to …
We propose and investigate new complementary methodologies for estimating predictive variance networks in regression neural networks. We derive a locally aware mini-batching scheme that result in sparse robust gradients, and show how to make unbiased weight updates to a variance network. Further, we formulate a heurist…
Efficiently learns Single-Index Models with constant factor approximation.
problem Learning Single-Index Models under L22 loss with unknown link functions. method An efficient algorithm using alignment sharpness for optimization.
result Achieves constant factor approximation to optimal loss for various distributions and link functions.
A scalable method for heavy-tailed gradients using cheap stochastic sub-processes.
problem Scalability issues with robust gradient descent under heavy-tailed gradients.
method Cheap stochastic sub-processes for a single pass over partitioned data.
result Improved scalability and robustness to perturbations.
FOCaL meta-learner estimates functional treatment effects robustly.
problem Estimating heterogeneous treatment effects from functional outcomes.
method Doubly robust meta-learner FOCaL integrating functional regression.
result Direct and robust estimation of F-CATE.
Paper proposes a controllable RANSAC method for anomaly detection.
problem Anomaly detection in regression models to improve prediction accuracy.
method CTRL-RANSAC method using hypothesis testing and Selective Inference framework.
result The method controls the probability of misidentifying anomalies below a specified level.
Deep learning architectures have proved versatile in a number of drug discovery applications, including the modelling of in vitro compound activity. While controlling for prediction confidence is essential to increase the trust, interpretability and usefulness of virtual screening models in drug discovery, techniques t…
BCCP uses bandit feedback to provide reliable predictions with limited labeled data.
problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.
New approach for open ad hoc teamwork using graph-based policy learning.
problem Designing autonomous agents to collaborate with changing teams without prior coordination.
method Graph-based policy learning to adapt to dynamic team compositions.
result Successfully models the effects of other agents, leading to robust adaptation and superior performance.
Algorithm estimates mixtures of arbitrary Gaussians robustly in presence of corruptions.
problem Estimating mixtures of arbitrary Gaussians in the presence of a constant fraction of arbitrary corruptions.
method Polynomial-time algorithm using partial clustering and tensor decomposition.
result Resolves the main open problem in several previous works on algorithmic robust statistics.
Nowadays model uncertainty has become one of the most important problems in both academia and industry. In this paper, we mainly consider the scenario in which we have a common model set used for model averaging instead of selecting a single final model via a model selection procedure to account for this model's uncert…
DRIFT uses RL to automate functional software testing efficiently.
problem Efficient and reliable automated software testing.
method DRIFT employs Q-learning with Graph Neural Networks on symbolic UI representations.
result DRIFT can robustly test software functionalities in a fully automated manner.
Study shows resampling labels improves classifier performance in noisy data.
problem Balancing sample size vs label reliability in noisy data.
method Comparing different validation strategies and analyzing MNIST database with varying noise levels.
result Classifier performance declines with high incorrect labels, highlighting the importance of resampling.
We consider unreliable distributed learning systems wherein the training data is kept confidential by external workers, and the learner has to interact closely with those workers to train a model. In particular, we assume that there exists a system adversary that can adaptively compromise some workers; the compromised …
Sum-product networks (SPNs) are flexible density estimators and have received significant attention due to their attractive inference properties. While parameter learning in SPNs is well developed, structure learning leaves something to be desired: Even though there is a plethora of SPN structure learners, most of them…
Ivy combines weak IV candidates to estimate causal effects robustly.
problem Estimating causal effects from observational data using weak or invalid IV candidates.
method Ivy synthesizes multiple weak IV candidates into a robust summary.
result Ivy produces more reliable causal effect estimates compared to allele scores.
Learn2Evaluate uses learning curves to estimate high-dimensional prediction performance.
problem Estimating test performance in high-dimensional data settings is challenging.
method Learn2Evaluate uses learning curves to estimate test performance at the total sample size.
result Learn2Evaluate provides a lower confidence bound for performance estimation.
Statsformer validates and adapts LLM-derived semantic priors for improved supervised learning.
problem Unreliable semantic priors from LLMs can degrade supervised learning performance.
method Adapts LLM-derived feature scores into a family of learner-specific prior-injection mechanisms, calibrating their influence using out-of-fold validation.
result Improves prediction performance by adaptively downweighting unreliable LLM priors, ensuring a guardrailed statistical learning system.
We study a novel machine learning (ML) problem setting of sequentially allocating small subsets of training data amongst a large set of classifiers. The goal is to select a classifier that will give near-optimal accuracy when trained on all data, while also minimizing the cost of misallocated samples. This is motivated…