The paper registers noisy curves using M-estimation for rotation and scaling parameters.
problem Registration of noisy curves with rotation and scaling parameters.
method M-estimation procedure for estimating rotation and scaling parameters.
result Consistency and asymptotic normality of the estimators proved.
Theory and method for reducing prediction variance in noisy feature-subsampled ridge ensembles.
problem Reduction of prediction variance in noisy data with feature bagging.
method Developed analytical learning curves for noisy ridge ensembles, introduced heterogeneous feature ensembling.
result Subsampling shifts the double-descent peak, leading to improved performance over a single linear predictor.
Principal Component Analysis (PCA) is the most common nonparametric method for estimating the volatility structure of Gaussian interest rate models. One major difficulty in the estimation of these models is the fact that forward rate curves are not directly observable from the market so that non-trivial observational e…
New method for comparing curves with flexible matching constraints.
problem Comparing plane curves with general elastic metrics.
method Combining transform for elastic metrics with parametrization-invariant fidelity metrics.
result Simple optimization problem for discretized curves.
New bounds for mixing time and privacy in projected Langevin algorithm and noisy SGD.
problem Analyzing mixing times and privacy in projected Langevin algorithm and noisy SGD.
method New bounds derived using PABI framework and optimization problems.
result New bounds for mixing time and privacy in projected Langevin algorithm and noisy SGD, showing dependency on gradient regularity.
Deep networks can interpolate noisy data without losing generalization.
problem Characterizing the relationship between interpolation and generalization in overparameterized deep networks.
method Analyzing the loss landscape of neural network functions over volumes around training data points, varying model parameters and training epochs.
result Loss sharpness in the input space follows a double descent, with large models predicting noisy targets over larger volumes around training data points.
In this letter, we propose a method for period estimation in light curves from periodic variable stars using correntropy. Light curves are astronomical time series of stellar brightness over time, and are characterized as being noisy and unevenly sampled. We propose to use slotted time lags in order to estimate corrent…
Statistical physics approaches can be used to derive accurate predictions for the performance of inference methods learning from potentially noisy data, as quantified by the learning curve defined as the average error versus number of training examples. We analyse a challenging problem in the area of non-parametric inf…
A common approach in positive-unlabeled learning is to train a classification model between labeled and unlabeled data. This strategy is in fact known to give an optimal classifier under mild conditions; however, it results in biased empirical estimates of the classifier performance. In this work, we show that the typi…
Overparameterized MLR fits hyper-curves, improving model robustness.
problem Improper predictors degrade model generalizability.
method Parameterizing with a scalar and monomial basis, fitting hyper-curves.
result Hyper-curve approach yields robust predictions for noisy data.
Deep learning models can overfit noisy data without losing generalization.
problem Understanding the generalization of deep learning models in noisy data.
method Empirical investigation of epoch-wise double descent in fully connected neural networks trained on CIFAR-10 with 30% label noise.
result The model achieves strong re-generalization on test data after overfitting noisy training data, corresponding to a 'benign overfitting' state.
This paper introduces a novel monotone curve estimation framework based on convex duality.
problem Estimating smooth, continuous, and monotonic curves in data.
method Convex duality and optimal transport theories.
result Established statistical guarantees for monotone curve estimates.
Framework for transferring discount curve estimates across fixed-income product classes.
problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.
A robust machine learning approach forecasts U.S. Treasury yields, reducing risk for investors.
problem Noisy and uncertain U.S. Treasury yields pose risk to forecast users.
method Formulates yield curve forecasting as a distributionally robust problem, combining factor models and machine learning.
result Robust forecast combinations improve out-of-sample performance across different maturity periods.
Neural network model improves robustness of mortgage bond yield curve estimation.
problem Overfitting and instability in traditional yield curve estimation methods for small mortgage bond markets.
method Neural network framework with a new loss function for smoothness and stability.
result Empirical results show more robust and stable yield curve estimates compared to existing methods.
Optimizes profit in targeted marketing across multiple markets with varying marketing expenditures.
problem Maximizing profit in a sequential marketing strategy with multiple markets and varying marketing costs.
method Near-optimal algorithms in an adversarial bandit setting, proving regret bounds for different demand curve types.
result Proved near-optimal regret bounds for the profit-maximization problem in targeted marketing.
We consider Bayesian analysis of a class of multiple changepoint models. While there are a variety of efficient ways to analyse these models if the parameters associated with each segment are independent, there are few general approaches for models where the parameters are dependent. Under the assumption that the depen…
Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…
The problem of active diagnosis arises in several applications such as disease diagnosis, and fault diagnosis in computer networks, where the goal is to rapidly identify the binary states of a set of objects (e.g., faulty or working) by sequentially selecting, and observing, (noisy) responses to binary valued queries. …
No accelerated gradient method for hyperbolic convex functions.
problem Existence of accelerated gradient methods for geodesically convex functions on hyperbolic spaces.
method Analysis of volume growth in negatively curved spaces.
result No-go theorem for accelerated gradient methods on hyperbolic plane.
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…
Optimizes noisy IS with better proposal densities.
problem Improving IS estimators with noisy data.
method Derives optimal proposal densities considering noise variance.
result Optimal proposals enhance IS estimators by focusing on noisy regions.
DynAEsti models ability as a time-varying curve, improving IRT for dynamic settings.
problem Traditional IRT models assume static ability; new approach models dynamic ability.
method DynAEsti augments traditional IRT Expectation Maximization with CurvFiFE for curve fitting.
result DynAEsti successfully recovers human performance dynamics in golf.
Class2Simi reduces noise in noisy label learning by transforming noisy class labels into noisy similarity labels.
problem Learning with noisy labels in supervised and unsupervised settings.
method Transforming noisy class labels into noisy similarity labels, training DNNs from noisy data pairs.
result The noise rate reduction is theoretically guaranteed, making it easier to handle noisy similarity labels.
Quantum neural networks can approximate noisy functions accurately.
problem Approximating noisy functions with quantum neural networks.
method Universal approximation theorem with error bounds for noisy quantum neural networks.
result Quantum neural networks can approximate noisy functions with precise error bounds.
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. Method detects and relabels noisy image labels to improve DNN performance.
problem Label noise in training images harms DNN generalization.
method Identifies noisy labels based on predictive uncertainty changes over training.
result Iterative relabeling of noisy labels improves DNN performance.
Simple method improves deep learning with noisy labels.
problem Deep learning's overfitting to noisy labels.
method Adds a variance regularization term to penalize neural network's Jacobian norm.
result Achieves state-of-the-art performance with high noise tolerance.
ExpertNet uses noisy labels to improve deep learning robustness.
problem Improving deep learning robustness against noisy labels.
method ExpertNet framework combining Amateur and Expert models, iteratively learning from noisy labels and images.
result ExpertNet achieves robust classification with as little as 20-50% training data, outperforming state-of-the-art models.
Self-training in linear models shows a U-shaped test-risk curve due to signal forgetting and denoising.
problem Understanding the dynamics of iterative self-training in high-dimensional linear regression.
method Derivation of deterministic-equivalent recursions for prediction risk and effective noise, analysis of signal forgetting and denoising effects.
result An optimal early-stopping time is determined, and a U-shaped test-risk curve is observed.
Paper tackles noisy similarity labels for multi-class classification.
problem Learning multi-class classifiers from noisy similarity-labeled data.
method Proposes a method using a noise transition matrix to learn from noisy data.
result Demonstrates superior performance compared to state-of-the-art methods.
Proposes coreset method for robust training of neural networks with noisy labels.
problem Overfitting of neural networks trained with noisy labels.
method Selects weighted subsets (coresets) of clean data points to approximate low-rank Jacobian matrix.
result Gradient descent applied to coreset subsets does not overfit noisy labels.
PSDR improves robustness against noisy labels by penalizing KL divergence between similar inputs.
problem Robust training of DNNs in datasets with noisy labels.
method Introduces PSDR, a manifold regularizer that penalizes KL divergence between similar inputs.
result Significantly improves robustness against noisy labels on benchmark datasets.
MARVEL curbs memorization of noisy labels in deep nets.
problem Noisy labels degrade deep net performance.
method MARVEL tracks classification margins to identify and abandon noisy instances.
result MARVEL outperforms baselines on noisy datasets.
Paper explains why small-loss criterion works for learning from noisy labels.
problem Learning from noisy labels in deep learning with limited labeled data.
method Theoretical analysis and reformulation of the small-loss criterion.
result Theoretical explanation and reformulation of the small-loss criterion.
Consensus NN learns from noisy data only for medical image denoising.
problem Lack of clean training data for medical image denoising.
method Trains neural network using only noisy data by splitting and combining subsets.
result Improved performance on denoising medical images compared to existing methods.
Study how noisy labels affect semi-supervised learning.
problem Effect of noisy labels on semi-supervised learning performance.
method Proposed an algorithm derived from a continuous relaxation of the Maximum A Posteriori (MAP) estimator for a Degree Corrected Stochastic Block Model (DC-SBM).
result Our approach achieves promising performance even with very noisy labeled data.
This work reveals how label noise can cause a final ascent in neural network performance curves.
problem The impact of label noise on the performance of neural networks.
method Theoretical analysis and extensive experiments on various neural network architectures.
result Label noise can lead to a final ascent in the test loss curve, improving generalization at intermediate model widths.
CrossFilter tackles noisy labels in audio tagging.
problem Noisy labels in large audio datasets.
method CrossFilter framework using multiple representations and multi-task learning.
result Improves audio tagging performance on FSDKaggle2018 and FSDKaggle2019 datasets.
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.
Improves classification accuracy with noisy labels using generative classifiers.
problem Handling noisy labels in large-scale datasets.
method Robust Generative Classifier (RoG) on top of pre-trained DNNs.
result Significantly improves classification accuracy with no re-training of the deep model.
Paper analyzes and improves DNNs trained with noisy labels.
problem Training deep neural networks with noisy labels.
method Characterize test accuracy as a function of noise ratio, apply cross-validation, and use Co-teaching strategy.
result Our strategy consistently improves DNNs' generalization performance.
CbMLC improves multi-label classification with noisy labels.
problem Evaluating multi-label classifiers with noisy labels.
method Context-Based Multi-Label Classifier (CbMLC) that handles noisy labels without additional supervision.
result CbMLC yields substantial improvements over previous methods in noisy label settings.
A new method simplifies noisy data filtering for CNNs.
problem Training CNNs with noisy labels is challenging.
method Joint Negative and Positive Learning (JNPL) combines NL+ and PL+ loss functions.
result Significantly simplifies the pipeline, achieving state-of-the-art accuracy.
The paper explores how noise in features can lead to benign overfitting in machine learning models.
problem Understanding the conditions for benign overfitting in machine learning models.
method Examined random feature models, specifically two-layer neural networks with fixed first layer weights, and analyzed the role of noise in features.
result Noise in features plays an important implicit regularization role in the phenomenon of benign overfitting.
Boosting classifiers improve accuracy with noisy inputs.
problem Noisy communication or computation degrades boosting classifier accuracy.
method Optimize resource allocation for base classifiers based on importance metrics.
result Optimized noisy boosting classifiers are more robust than bagging.
Adapts IG for better feature attributions and robustness.
problem Reliability concerns in feature attributions for deep learning models.
method Adaptation of path-based feature attribution to Riemannian geometry of data manifolds.
result IG along geodesics generates more intuitive and robust explanations.
Paper shows how noisy data can improve robust decision-making.
problem The challenge of noisy data in decision-making.
method Distributionally robust optimization (DRO) with a novel ambiguity set construction.
result Noisy data can lead to more robust and equitable decisions.