A new correction term improves sample efficiency in deep reinforcement learning.
problem Momentum accumulation in TD learning leads to doubly stale gradients.
method Proposed a correction term to address the issue of doubly stale gradients.
result Improves sample efficiency in policy evaluation.
This work explores test-time scaling strategies for LLMs, improving sample efficiency and expressiveness.
problem Understanding the sample efficiency and expressiveness of test-time scaling strategies for LLMs.
method Established separation and expressiveness results for self-consistency, best-of-n, and self-correction strategies. result Self-correction enables Transformers to simulate online learning over multiple tasks without prior knowledge.
Efficient autoregressive entity linking with correction for faster, more accurate results.
problem High computational cost and non-parallelizable decoding in autoregressive entity linking.
method Parallelizes autoregressive linking across all mentions, uses a shallow decoder, and adds a discriminative correction term.
result 70 times faster and more accurate than previous methods, outperforming state-of-the-art approaches.
SCaSML improves PDE solvers by correcting errors efficiently.
problem Reliable and error-free high-dimensional PDE solutions.
method Defect correction method to derive a Structural-preserving Law of Defect.
result SCaSML achieves faster convergence and reduced errors in high-dimensional PDEs.
A new method improves stochastic gradient descent for faster and more efficient estimation.
problem Efficient and fast parametric estimation methods.
method Projected stochastic gradient descent corrected by Fisher scoring.
result The method is faster and more efficient than traditional methods.
We consider a class of misspecified dynamical models where the governing term is only approximately known. Under the assumption that observations of the system's evolution are accessible for various initial conditions, our goal is to infer a non-parametric correction to the misspecified driving term such as to faithful…
Max-rank improves multiple testing in conformal prediction.
problem Simultaneous testing of multiple hypotheses in scientific inquiries.
method Introduces max-rank, a novel correction for positive dependencies in simultaneous testing.
result Max-rank efficiently controls family-wise error rate and improves predictive uncertainty estimates.
New MCMC method corrects bias without extra cost.
problem Correcting bias in MCMC algorithms without additional computational cost.
method Generalized Markov Chain Importance Sampling methods.
result Proposed methods are more efficient than Metropolis-Hastings versions.
Imitation learning, followed by reinforcement learning algorithms, is a promising paradigm to solve complex control tasks sample-efficiently. However, learning from demonstrations often suffers from the covariate shift problem, which results in cascading errors of the learned policy. We introduce a notion of conservati…
CONFINE enhances neural networks' interpretability without sacrificing accuracy.
problem Lack of interpretability in deep neural networks, especially in healthcare.
method CONFINE uses conformal prediction to generate prediction sets with robust uncertainty estimates.
result CONFINE achieves correct efficiency up to 3.3% higher than original accuracy.
Efficient surrogate modeling for complex PDEs with physical laws.
problem High computational cost of repeated PDE simulations.
method LC-prior Gaussian process with POD and RBF-FD.
result Significantly reduced computational cost and improved accuracy.
A new method improves super learner validation efficiency.
problem Improving the efficiency of super learner validation.
method Bootstrap Bias Corrected Cross Validation applied to Super Learning.
result Bootstrap Bias Corrected Cross Validation proved efficient and cost-effective.
AMAGOLD improves stochastic gradient MCMC by infrequent Metropolis-Hastings corrections.
problem Bias in stochastic gradient Hamiltonian Monte Carlo (SGHMC).
method AMAGOLD infrequently uses Metropolis-Hastings corrections to remove bias, with a fixed step size schedule.
result AMAGOLD converges to the target distribution with a fixed, rather than a diminishing, step size, and at most a constant factor slower convergence rate.
Recent work on policy learning from observational data has highlighted the importance of efficient policy evaluation and has proposed reductions to weighted (cost-sensitive) classification. But, efficient policy evaluation need not yield efficient estimation of policy parameters. We consider the estimation problem give…
Bias correction needed after deep learning regression training.
problem Systematic error accumulation in deep learning regression models.
method Adjust bias of the machine learning model post-training.
result Bias correction efficiently solves error accumulation.
This paper improves deep learning model consistency through ensemble methods.
problem Consistency and correct-consistency issues in deep learning models.
method Formal definition of consistency and correct-consistency, proving ensemble improvement, proposing dynamic snapshot ensemble method.
result Ensemble methods can improve correct-consistency of deep learning models.
We present a new algorithm to generate minimal, stable, and symbolic corrections to an input that will cause a neural network with ReLU activations to change its output. We argue that such a correction is a useful way to provide feedback to a user when the network's output is different from a desired output. Our algori…
New method improves Bayesian inference for parametric models, robust to misspecification.
problem Inference can be untrustworthy when parametric models are wrong.
method Adaptive nonparametric corrections for parametric Bayesian models using generalized Bayes.
result The method achieves robustness and efficiency, converging fast when the parametric model is close to true.
Study proposes a new method to estimate bias-correction term for ATE estimation.
problem Estimating the bias-correction term for ATE estimation.
method Directly estimating the bias-correction term by minimizing Bregman divergence.
result Automatic covariate balancing property achieved through specific model choices.
Efficiently estimates rare events using multifidelity modeling.
problem Estimating rare events with computationally expensive models.
method Active learning with multifidelity modeling, adapting the number of high-fidelity simulations based on problem complexity and desired accuracy.
result Significantly reduced the number of high-fidelity model calls while maintaining accuracy.
Paper proposes an efficient method for bounding box annotation in object detection.
problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.
Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.
problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.
The existing approaches to intrinsic dimension estimation usually are not reliable when the data are nonlinearly embedded in the high dimensional space. In this work, we show that the explicit accounting to geometric properties of unknown support leads to the polynomial correction to the standard maximum likelihood est…
P3I learns holistic scene representations from a single image.
problem Inferring camera poses, object locations, and global scene structures from a single image.
method Combines search-based and gradient-based algorithms.
result P3I outperforms baselines on various image manipulation tasks.
Finding optimal correction of errors in generic stabilizer codes is a computationally hard problem, even for simple noise models. While this task can be simplified for codes with some structure, such as topological stabilizer codes, developing good and efficient decoders still remains a challenge. In our work, we syste…
We provide a correction to the expression for scoring Gaussian directed acyclic graphical models derived in Geiger and Heckerman [Ann. Statist. 30 (2002) 1414-1440] and discuss how to evaluate the score efficiently.
ProxySHAP approximates Shapley and Banzhaf interactions efficiently.
problem Efficient estimation of complex machine learning interactions.
method ProxySHAP combines tree-based proxy models with residual correction.
result ProxySHAP achieves state-of-the-art interaction approximation quality.
Proposes a method for obtaining interval bounds in off-policy evaluation.
problem Provides provably correct upper and lower bounds for off-policy evaluation.
method Searches for the maximum and minimum values of the expected reward among Lipschitz Q-functions.
result Introduces a Lipschitz value iteration method to monotonically tighten interval bounds.
Corrects errors in ILA for Bayesian inference in LGMs.
problem Error in ILA for non-Gaussian likelihoods in LGMs.
method Importance sampling scheme to correct ILA errors.
result Corrected posterior converges to the true posterior with increased samples.
Theoretical analysis shows MDMs can be efficient but not for all metrics.
problem Understanding the efficiency-accuracy trade-off of diffusion language models.
method Theoretical analysis of Masked Diffusion Model (MDM) using perplexity and sequence error rate as metrics.
result MDM achieves near-optimal perplexity but requires linear scaling for sequence error rate, highlighting efficiency-accuracy trade-offs.
Deep learning is also known as hierarchical learning, where the learner _learns_ to represent a complicated target function by decomposing it into a sequence of simpler functions to reduce sample and time complexity. This paper formally analyzes how multi-layer neural networks can perform such hierarchical learning _ef…
New method improves robustness of double robust estimators under complete misspecification.
problem Improper performance of double robust estimators when all nuisance functions are misspecified.
method DR+ACC, an adaptive correction clipping method.
result DR+ACC ensures bounded error and maintains semiparametric efficiency.
New method improves sampling from score-based models by correcting bias.
problem Bias in sampling from score-based diffusion models.
method Metropolis-Hastings or Barker's accept-reject steps to correct bias, using the score function.
result Improves sample quality on synthetic and image datasets, yielding consistent gains in FID.
Machine learning models predict brain age with systematic bias, corrected in this study.
problem Systematic bias in machine learning regression models for brain age prediction.
method General constrained optimization approach to correct bias.
result Our method effectively eliminates the bias from brain age predictions.
Artificial Intelligence (AI) systems sometimes make errors and will make errors in the future, from time to time. These errors are usually unexpected, and can lead to dramatic consequences. Intensive development of AI and its practical applications makes the problem of errors more important. Total re-engineering of the…
Proposes PRMs for interpreting financial risk concept drift.
problem Concept drift in high-stakes predictions like credit risk.
method Probabilistic Rule Models (PRMs) using Markov Logic Networks.
result Interpretable rules explain borrower risk changes.
Develops methods to correct bias in AI feedback for more accurate alignment.
problem Systematic bias in AI feedback compared to human labels.
method Two debiased alignment methods: DDPO and DIPO.
result Methods improve alignment efficiency and performance close to human-labeled data.
A new approach reduces the size of prediction sets in CP, making it more efficient.
problem Large and costly prediction sets in standard CP.
method Expand correctness criterion to include inferred admissible answers, and use prediction cascades to prune implausible labels.
result Empirically effective in natural language processing and drug discovery.
The paper develops methods to assess and correct model uncertainties in graphical models.
problem Model uncertainty in probabilistic graphical models.
method Information-theoretic and non-parametric stress tests.
result Ranking and correcting impactful sources of uncertainty in graphical models.
This paper examines interest rates and market efficiency in DeFi loanable funds protocols.
problem Equilibrium of supply and demand for loanable funds in DeFi protocols.
method Review of interest rate mechanisms in Compound, Aave, and dYdX; empirical analysis of market efficiency and inter-connectedness.
result Interest rate rules in DeFi protocols do not always equilibrate supply and demand.
In this work, we addressed the issue of applying a stochastic classifier and a local, fuzzy confusion matrix under the framework of multi-label classification. We proposed a novel solution to the problem of correcting label pairwise ensembles. The main step of the correction procedure is to compute classifier- specific…
Develops a new tensor model for clustering with degree correction.
problem Clustering with unknown degree heterogeneity in multiway data.
method Degree-corrected tensor block model with estimation guarantees.
result Demonstrates an intrinsic statistical-to-computational gap for tensors of order three or greater.
Paper proposes an efficient method for calibrating spatio-temporal forecasts.
problem Real-world spatio-temporal forecasting challenges like signal anomalies and distributional shifts.
method Learning with Calibration (ST-TTC) for real-time bias correction.
result ST-TTC improves spatio-temporal forecasting accuracy with reduced computational cost.
A new method corrects bias in high-dimensional ridge regression.
problem Inherent bias in ridge regression limits statistical efficiency and scalability.
method Iterative bias correction strategy for p<n and Ridge-Screening method for p>n. result Valid inferences and asymptotic properties established for de-biased ridge estimators.
Two approaches improve conformal Bayes for label shift, one post-hoc and one in-training.
problem Improving prediction sets for target domain under label shift.
method Two complementary approaches: post-hoc calibration and in-training adaptation.
result In-training adaptation achieves up to 43% width reduction at unchanged coverage.
In distributed systems, communication is a major concern due to issues such as its vulnerability or efficiency. In this paper, we are interested in estimating sparse inverse covariance matrices when samples are distributed into different machines. We address communication efficiency by proposing a method where, in a si…
In an efficient stock market, the log-returns and their time-dependent variances are often jointly modelled by stochastic volatility models (SVMs). Many SVMs assume that errors in log-return and latent volatility process are uncorrelated, which is unrealistic. It turns out that if a non-zero correlation is included in …
Recently, a lot of effort has been paid to the efficient computation of Kriging predictors when observations are assimilated sequentially. In particular, Kriging update formulae enabling significant computational savings were derived in Barnes and Watson (1992), Gao et al. (1996), and Emery (2009). Taking advantage of …