New method calibrates probabilistic regression models without restrictive assumptions.
problem Ensuring predictive distributions accurately reflect true uncertainty.
method Nonparametric re-calibration algorithm based on conditional kernel mean embeddings.
result Consistently outperforms prior re-calibration approaches across various benchmarks.
Mitigates overfitting in UU classification from two unlabeled datasets.
problem Overfitting in the UU classification method.
method Wrapping negative empirical risk terms with correction functions and proving consistency.
result Successfully mitigates overfitting and improves classification accuracy.
Improved TD learning reduces batch sampling error.
problem TD learning can be inaccurate in batch settings due to action weighting.
method Introduced PSEC-TD(0) to correct action weighting using importance sampling.
result PSEC-TD(0) produces more accurate value function estimates.
Machine learning improves chaotic dynamical system simulations with empirical error correction.
problem Improving chaotic dynamical system simulations using machine learning.
method Combining machine learning with physically-derived models to correct timestep errors.
result The approach yields stable models with improved long-term statistics and single time-step tendencies.
This work proves L2-regularized ERM controls smCE without post-hoc correction.
problem Calibration of predicted probabilities in machine learning models.
method Canonical L2-regularized empirical risk minimization. result Theoretical proof that smCE is controlled by ERM without post-hoc correction.
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.
A deep learning autoencoder improves error correction for one-bit quantization.
problem Improving error correction for one-bit quantization in AWGN channels.
method Proposes a novel autoencoder-based coding scheme using turbo codes as implicit regularization.
result Empirically and theoretically shows nearly optimal performance of the proposed coding scheme.
Bayesian method corrects bias in class-aggregated values.
problem Bias in aggregated values from classification algorithms.
method Bayesian inference with constraints on model parameters.
result Outperforms existing methods in mean squared error.
Corrected graph convolutions improve node classification on graphs.
problem Oversmoothing in graph convolutions degrades performance.
method Theoretical analysis based on CSBM, spectral analysis for k rounds of corrected graph convolutions.
result Corrected graph convolutions can improve node classification performance exponentially.
Paper derives PAC-Bayesian bounds for LTI systems learning from empirical data.
problem Characterizing predictive power of LTI systems learned from data.
method PAC-Bayesian bounds for LTI stochastic dynamical systems with inputs.
result Finite-sample error bounds for learning algorithms of LTI systems.
Improved GEC models use scored data from large pretraining to outperform.
problem Addressing data sparsity in Grammatical Error Correction.
method Derive example-level scores from a smaller, higher-quality dataset and incorporate delta-log-perplexity into training schedules.
result Models trained on scored data achieve state-of-the-art results.
A model corrects Lithuanian grammatical errors.
problem Lack of language skills and typing errors in Lithuanian.
method Transformer architectures for subword and byte-level approaches.
result F0.5=0.92 for Lithuanian grammatical error correction. New AI error correctors improve classifier performance with provable guarantees.
problem Improving AI classifier performance with scarce training data.
method Weakly supervised AI error correctors with performance guarantees.
result Provable performance guarantees for AI error correction.
The study examines methods to correct measurement error in nutritional epidemiology studies.
problem Measurement error in nutritional studies leads to biased and underconfident estimates.
method The article reviews various bias-correction models for exposure variables in nutritional epidemiology.
result Bias-correction methods are essential for accurate inference in nutritional studies.
Khovanov homology helps create quantum error-correcting codes.
problem Creating robust quantum error-correcting codes.
method Using Khovanov homology and its extensions to define and analyze quantum codes.
result New families of quantum codes with desirable properties.
Error correction for correlated regressors using compressed sensing.
problem Measuring errors in regression tasks with sparse correlations.
method Compressed sensing applied to error signals, with ℓ1-minimization for uniqueness. result Correct solution recovery in settings of error correction.
Boosted decision trees typically yield good accuracy, precision, and ROC area. However, because the outputs from boosting are not well calibrated posterior probabilities, boosting yields poor squared error and cross-entropy. We empirically demonstrate why AdaBoost predicts distorted probabilities and examine three cali…
Study loop corrections in random feature models affecting training and test errors.
problem Analyzing loop corrections in random feature models to understand training and test errors.
method Statistical physics and effective field theory approach to study loop corrections.
result Derived loop corrections to training error, test error, and generalization gap.
ECNN combines binary classifiers to protect neural networks from adversarial attacks.
problem Vulnerability of neural networks to adversarial inputs.
method Designs an error-correcting code matrix to maximize row and column distances, training end-to-end.
result ECNN effectively defends against adversarial attacks with good accuracy on normal examples.
Machine learning systems increasingly depend on pipelines of multiple algorithms to provide high quality and well structured predictions. This paper argues interaction effects between clustering and prediction (e.g. classification, regression) algorithms can cause subtle adverse behaviors during cross-validation that m…
MAFLA improves sampling from heavy-tailed distributions using MH-inspired corrections.
problem Sampling from heavy-tailed and multimodal distributions when neither target nor proposal densities can be evaluated.
method Metropolis-Adjusted Fractional Langevin Algorithm (MAFLA) with Score Balance Matching.
result MAFLA significantly improves finite-time sampling accuracy over unadjusted fractional Langevin dynamics.
New theory explains how strong models can learn from weak ones.
problem Learning from weak, incomplete, or incorrect labels.
method New bounds based on data distribution and student hypothesis class.
result Existing weak supervision theory fails to account for pseudolabel correction and coverage expansion.
Fault-tolerant neural networks inspired by biological error correction codes.
problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.
Correction for Error estimates for binomial approximations of game options [math.PR/0607123]
New synthetic data analysis reveals high type 1 error rates.
problem Analyzing synthetic data for inference raises significant methodological challenges.
method Developed statistical inference tools and conducted a simulation study.
result Type 1 error rates are unacceptably high in synthetic data analysis.
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.
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.
Proposes a model combining difference-attention and error-correction LSTMs for improved time series prediction.
problem Improving accuracy in time series prediction.
method Combines difference-attention LSTM and error-correction LSTM in a cascade approach.
result Improves prediction accuracy in time series.
Bayesian method for high-dimensional VECM analysis of cointegration.
problem Efficiently determining cointegration rank in high-dimensional time series.
method Bayesian approach to analyze cointegration matrix.
result Promising results in high-dimensional settings with low sample size.
New method combines machine learning with data assimilation for model error correction.
problem Correcting model errors using sparse and noisy observations.
method Hybrid machine learning and data assimilation methods.
result Tendency correction outperforms resolvent correction in data assimilation experiments.
A technique to quickly fix mistakes in neural networks.
problem Fixing model errors in neural networks quickly and without affecting other samples.
method Editable Training, a model-agnostic training technique.
result Effectiveness demonstrated on large-scale image classification and machine translation tasks.
We consider the topic of multivariate regression on manifold-valued output, that is, for a multivariate observation, its output response lies on a manifold. Moreover, we propose a new regression model to deal with the presence of grossly corrupted manifold-valued responses, a bottleneck issue commonly encountered in pr…
A new model of learning corrects for chance to improve learning outcomes.
problem The importance of chance-corrected measures in learning.
method Developed two models: Informatron and AdaBook, based on empirical psychological results.
result Chance correction facilitates learning, as shown by computational results.
We introduce the speculate-correct method to derive error bounds for local classifiers. Using it, we show that k nearest neighbor classifiers, in spite of their famously fractured decision boundaries, have exponential error bounds with O(sqrt((k + ln n) / n)) error bound range for n in-sample examples.
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…
Bayesian RL enhances LLMs to reflectively explore and correct errors.
problem LLMs trained via RL lack reflective behaviors like rethinking and error correction.
method Bayesian RL framework that optimizes expected return under posterior distribution over Markov decision processes.
result BARL algorithm improves LLM performance in reasoning tasks.
In this note we point out an error in the above paper and refer to some papers where this error is corrected and a more general theorem is proved.
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.
Study improves binary classification with multiple corrupted samples.
problem Binary classification with multiple corrupted training samples.
method Minimizes weighted combination of corruption-corrected empirical risks.
result Optimal weights are functions of sample sizes and corruption degrees.
New method corrects bias in density ratio estimation for missing data.
problem Missing data bias in density ratio estimation.
method Adapted KLIEP method (M-KLIEP) for MNAR data.
result M-KLIEP restores consistency and minimax optimality.
Improves ASR accuracy for domain mismatch using machine translation.
problem Domain mismatch in ASR systems leads to suboptimal results.
method Machine translation to map out-of-domain ASR errors to in-domain terms.
result 7% absolute improvement in word error rate, 4 point BLEU score improvement.
New truthful calibration errors improve model ranking in multiclass prediction.
problem Non-truthful calibration errors can mislead model comparisons.
method Introduced perfectly truthful calibration errors for multiclass predictions.
result Truthful calibration errors preserve decision-theoretic dominance and stabilize model rankings.
ECNNs improve stock market predictions by correcting errors from previous steps.
problem Missing input variables in economic forecasting.
method Error Correction Neural Networks (ECNNs) that correct errors from previous steps.
result ECNNs outperform simple RNNs and other hybrid models.
Proposes a guaranteed regularization method for maximum likelihood estimation using gauge symmetry in Kullback-Leibler divergence.
problem Overfitting in maximum likelihood estimation.
method Introduces a regularization approach based on gauge symmetry in Kullback-Leibler divergence.
result The method provides a theoretically guaranteed optimal model without frequent hyperparameter tuning.
The paper connects three machine learning methods to reduce generalization errors.
problem Reducing generalization errors in machine learning models.
method Distributionally robust optimization, Bayesian methods, and regularization.
result Machine learning models can be characterized using distributional uncertainty and robustness measures.
New method corrects Laplace/BIC errors in singular models, revealing effective dimension.
problem Laplace/BIC errors in singular models due to incorrect effective dimension assumption.
method RLCT (real log canonical threshold) to correct effective dimension in linear models.
result Correct evidence slope and effective dimension estimation in linear settings.
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 invariant for prime alternating knots from error-correcting codes
problem Distinguishing prime alternating knots
method Alexander-Briggs code
result New invariant succeeds in separating knots that other invariants fail