New sampling method makes fictitious play consistent in repeated games.
problem Fictitious play fails to be Hannan consistent in repeated games.
method Introduced sampled fictitious play with Bernoulli sampling, proving it is Hannan consistent.
result Sampled fictitious play is Hannan consistent using anti-concentration results.
The paper introduces a new model selection criterion for various time series models.
problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.
The study evaluates three IC for selecting Hawkes process model order in financial data.
problem Model selection for Hawkes process with financial data.
method Testing AIC, BIC, HQ on simulated data.
result Correct model selection success rate varies with sample size and IC type.
This paper is devoted to regret lower bounds in the classical model of stochastic multi-armed bandit. A well-known result of Lai and Robbins, which has then been extended by Burnetas and Katehakis, has established the presence of a logarithmic bound for all consistent policies. We relax the notion of consistence, and e…
MIC improves VAR order selection accuracy.
problem Order selection in VAR models for accurate forecasting.
method MIC based on expected squared error loss.
result MIC consistently estimates true VAR order.
Conventional learning with expert advice methods assumes a learner is always receiving the outcome (e.g., class labels) of every incoming training instance at the end of each trial. In real applications, acquiring the outcome from oracle can be costly or time consuming. In this paper, we address a new problem of active…
New methods for estimating ARMA and GARCH models with stable noise.
problem Estimating parameters of ARMA and GARCH models with stable noise.
method Modified Hannan-Rissanen Method and Modified Empirical Characteristic Function for estimation.
result Efficiency, accuracy, and simplicity of proposed methods demonstrated through simulation.
We study tick-by-tick financial returns belonging to the FTSE MIB index of the Italian Stock Exchange (Borsa Italiana). We can confirm previously detected non-stationarities. However, scaling properties reported in the previous literature for other high-frequency financial data are only approximately valid. As a conseq…
Study of loss functions for learning to defer, proving consistency.
problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by Ψ and proved their consistency. result Proved realizable H-consistency and Bayes-consistency of specific surrogate losses. In this paper we study the consistency of an empirical minimum error entropy (MEE) algorithm in a regression setting. We introduce two types of consistency. The error entropy consistency, which requires the error entropy of the learned function to approximate the minimum error entropy, is shown to be always true if the…
Paper analyzes consistency between neural networks at different levels.
problem Understanding knowledge consistency between neural networks.
method Generic definition and task-agnostic method to disentangle consistent knowledge.
result Knowledge consistency provides new insights and can improve network performance.
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.
Empirical study shows consistent meta-RL algorithms adapt to OOD tasks.
problem Theoretical consistency of meta-RL algorithms and its practical implications.
method Empirical investigation of representative meta-RL algorithms, focusing on consistency and adaptation to out-of-distribution tasks.
result Theoretical consistent algorithms can adapt to OOD tasks, while inconsistent ones cannot, but can still fail for poor exploration.
Paper explores grafting consistent estimators to improve Random Forest consistency.
problem Ensuring Random Forests are consistent despite their performance.
method Grafting consistent estimators onto a shallow CART.
result Grafted estimators provide a consistency guarantee and perform well empirically.
Paper proves LCVB method's consistency in Bayesian posteriors and decision rules.
problem Approximating Bayesian posteriors and decision rules.
method Loss-calibrated variational Bayes (LCVB) method.
result LCVB method's consistency in both approximate posterior and decision rules.
Unified model improves sampling speed and quality.
problem Difficult to balance sampling speed and quality.
method Multistep Consistency Models combining consistency and diffusion models.
result Improved sampling quality with reduced steps.
Quick Shift gets consistent at clustering and mode recovery.
problem Consistency in clustering and mode recovery for Quick Shift.
method Statistical consistency guarantees for Quick Shift under mild assumptions.
result Constructed a consistent modal regression algorithm.
Paper connects risk consistency to L_p consistency for broader loss functions.
problem Establishing risk consistency for a wider class of loss functions.
method Analyzes the connection between risk consistency and L_p-consistency for various loss functions.
result Shifted loss functions do not reduce assumptions as much as other results.
Improves GAN-based semi-supervised learning with consistency regularization.
problem Lack of consistency in class probability predictions under local perturbations.
method Introduces consistency regularization to GANs, leveraging both local and interpolation consistency.
result Significantly improves performance and achieves new state-of-the-art results.
New risk measures for multivariate data, consistent and decomposable.
problem Developing consistent risk measures for multiple variables.
method Showed strong consistency leads to decomposition into aggregation and univariate risk.
result Multivariate risk measures are conditional certainty equivalents under strong consistency.
This paper establishes a theoretical foundation for consistency training in diffusion models.
problem Lack of a comprehensive theoretical understanding of consistency training in diffusion models.
method Demonstrates the necessity of a number of steps in consistency learning exceeding d5/2/ε for generating samples within ε proximity to the target distribution. result Establishes rigorous insights into the validity and efficacy of consistency models, offering theoretical underpinnings for their utility.
Paper introduces new actuarial-consistent valuations for insurance liabilities.
problem Valuation of insurance liabilities considering both financial and actuarial risks.
method Proposes two-step actuarial valuations and actuarial-consistent procedures.
result Actuarial-consistent valuations are equivalent to two-step actuarial valuations under coherence.
New clustering method avoids problematic properties of existing algorithms.
problem Existing clustering algorithms cannot satisfy all natural clustering properties.
method Developed Morse Clustering using Morse Theory to satisfy Kleinberg's axioms with a new property, Monotonic Consistency.
result Morse Clustering satisfies Kleinberg's original axioms with Consistency replaced by Monotonic Consistency.
Universal Bayes consistency proved in metric spaces.
problem Proving universal Bayes consistency in metric spaces.
method Extending a multiclass learning algorithm and proving its Bayes-consistency in all metric spaces.
result First learning algorithm universally strongly Bayes-consistent in all metric spaces.
We improve random forest consistency and performance with DMRF, a new variant.
problem Improving the consistency and performance of random forest models.
method Developed DMRF, a data-driven multinomial random forest, by modifying proof methods and improving data utilization.
result DMRF achieves strong consistency with probability 1, surpassing previous models in classification tasks.
Fisher consistency improves class probability estimation under dataset shift.
problem Lack of Fisher consistency can lead to unreliable class probability estimates.
method Introduced Fisher consistency as a desirable property for class prior probability estimators.
result CDE-Iterate is not Fisher consistent and cannot be trusted for reliable estimates.
This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.
problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable H-consistency, H-consistency bounds, and Bayes-consistency for deferral learning. Unified surrogate loss framework for multi-label learning with strong consistency guarantees.
problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.
Study of hill-climbing clustering methods and their consistency.
problem Consistency of hill-climbing clustering methods.
method Continuous-space and discrete-space hill-climbing approaches.
result Established consistency of the methods.
Learning rule consistency tied to non-existence of real-valued measurable cardinals.
problem Consistency of k-NN learning rule in metric spaces.
method Analyzing separable subspaces and density conditions.
result The k-NN classifier's consistency depends on the absence of real-valued measurable cardinals.
The paper proves consistency of GVI posteriors under minimal conditions.
problem Consistency of generalized variational inference posteriors.
method Proves consistency using Γ-convergence theory. result GVI posteriors are consistent and collapse to the population-optimal parameter value.
New method evaluates language model forecasters by checking consistency of predictions.
problem Evaluating the performance of language model forecasters is difficult due to lack of ground truth.
method Developed a consistency check framework based on arbitrage to evaluate forecasters.
result Consistency metrics correlate with ground truth performance of LLM forecasters.
Study improves H-consistency bounds for regression analysis.
problem Improving H-consistency bounds for regression analysis. method Generalized theorems and novel H-consistency bounds for various surrogate loss functions. result Derives principled surrogate losses for adversarial regression.
MTSCI uses diffusion models to impute multivariate time series data with consistency.
problem Imputation of missing values in multivariate time series data.
method MTSCI employs a contrastive complementary mask and mixup mechanism to ensure intra-consistency and inter-consistency.
result MTSCI achieves state-of-the-art performance on multivariate time series imputation tasks.
Self-consistent models improve reinforcement learning by aligning predictions with future values.
problem Improving reinforcement learning by aligning model predictions with future values.
method Proposes multiple self-consistency updates to encourage a learned model and value function to be consistent with each other.
result Self-consistency helps both policy evaluation and control in both tabular and function approximation settings.
Consistent estimation of constrained autoregressive processes.
problem Estimating autoregressive processes with coefficients constrained to an ellipsoid.
method Use of constrained and penalized estimators under different norms.
result Provide consistency results for estimation of constrained autoregressive processes.
Prefix consistency improves model reliability by weighting answers based on their reproducibility.
problem Improving the reliability of large language models' reasoning traces.
method Use prefix consistency to weight candidate answers based on their reproducibility during regeneration.
result Prefix consistency is the best correctness predictor, reaching Standard MV plateau accuracy with up to 21x fewer tokens.
The paper concerns primal and dual representations as well as time consistency of set-valued dynamic risk measures. Set-valued risk measures appear naturally when markets with transaction costs are considered and capital requirements can be made in a basket of currencies or assets. Time consistency of scalar risk measu…
The paper explores time consistency for scalar multivariate risk measures in markets with transaction costs.
problem Time consistency of scalar multivariate risk measures in markets with transaction costs.
method Presented dual representations and derived an equivalent recursive formulation for multivariate scalar risk measures.
result Developed a direct notion of a 'moving scalarization' for scalar time consistency.
Consistency regularization improves robustness to noisy labels.
problem Improving model robustness to noisy labels in machine learning.
method Empirical study of consistency regularization on noisy datasets.
result Consistency regularization improves model robustness to label noise.
The paper establishes conditions for Bayesian consistency in supremum metric.
problem Ensuring Bayesian consistency in the supremum metric.
method Using a triangle inequality and weak convergence, the paper establishes conditions for Bayesian consistency.
result Demonstrates supremum consistency with weaker conditions than previously used.
Enhances random forest consistency and introduces DMRF for improved performance.
problem Improving the consistency and efficiency of random forest algorithms.
method Strengthened proof methods and propose DMRF algorithm.
result DMRF achieves better theoretical and experimental performance than previous variants.
Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.
problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.
Develops PLL methods that are provably consistent and compatible with any deep network.
problem Lack of theoretical understanding and consistency in partial-label learning methods.
method Proposes a generation model for candidate label sets and develops two PLL methods that are risk- and classifier-consistent.
result Two novel PLL methods are guaranteed to be provably consistent.
New method improves consistency in preference learning for neural networks.
problem Inconsistent surrogate losses in preference learning for neural networks.
method Formulated a margin-shifted ranking framework and introduced Structure-Aware H-consistency. result Proved superior consistency guarantees for capacity-bounded models using heavy-tailed surrogates.
ε-Consistent Mixup improves semi-supervised classification accuracy.
problem Improving semi-supervised classification accuracy with limited labeled data.
method Combines Mixup's linear interpolation with consistency regularization, using an adaptive tradeoff between the two.
result ε-Consistent Mixup yields the largest gains in low label-availability scenarios.
Study shows k-NN regressor consistency in complex survey designs.
problem Lack of consistency results for k-NN regressor in complex survey data. method Analysis of regularity conditions on sampling design and data distribution.
result Consistency of k-NN regressor under complex survey designs. Proves DCNNs with expansive convolution are strongly universally consistent.
problem Theoretical consistency of deep convolutional neural networks (DCNNs).
method Empirical risk minimization on DCNNs with expansive convolution (with zero-padding).
result DCNNs with expansive convolution are strongly universally consistent.