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.
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.
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.
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.
Proposes MRF for consistency and privacy in RF.
problem Insufficient theoretical understanding of RF's consistency and privacy.
method Introduces MRF with multinomial distributions for feature and value selection.
result Proves MRF's consistency and analyzes its privacy within differential privacy.
The paper identifies regions where investment strategies match expected performance.
problem Inconsistent performance of Markowitz efficient portfolios.
method Density forecasting to measure ex-ante accuracy and identify the consistency region.
result Investment strategies based on consistent portfolios outperform efficient ones.
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.
This paper improves multi-label ranking by reweighting univariate losses, enhancing consistency and performance.
problem Improving multi-label ranking performance while maintaining consistency.
method Systematic study of consistency and generalization error bounds for learning algorithms, proposing a reweighted univariate loss.
result Inconsistent pairwise losses can lead to better performance than consistent univariate losses in practice.
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.
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.
Consistent algorithms for multiclass learning with complex metrics and constraints.
problem Learning with complex performance metrics and constraints.
method General framework for designing consistent algorithms by viewing the problem as an optimization over feasible confusion matrices.
result Rates of convergence to the optimal (feasible) classifier, showing asymptotic consistency.
Improved portfolio optimization reduces sensitivity to neural network initialization.
problem High sensitivity to neural network initialization in portfolio optimization.
method Robust end-to-end framework for risk budgeting portfolios.
result Enhanced stability in portfolio optimization without compromising performance.
In this work we give a comprehensive overview of the time consistency property of dynamic risk and performance measures, focusing on a the discrete time setup. The two key operational concepts used throughout are the notion of the LM-measure and the notion of the update rule that, we believe, are the key tools for stud…
We define Conditional quasi concave Performance Measures (CPMs), on random variables bounded from below, to accommodate for additional information. Our notion encompasses a wide variety of cases, from conditional expected utility and certainty equivalent to conditional acceptability indexes. We provide the characteriza…
Improved neural network surrogates for ICF using manifold and cycle consistency.
problem Modeling and predicting complex physical processes in inertial confinement fusion.
method Training neural network surrogates that are consistent with the physical manifold and cyclically consistent.
result Surrogates are superior in predictive performance, more resilient to sampling artifacts, and more data efficient.
SSFN self-estimates network size with low complexity and consistent performance.
problem Designing a self-estimating feed-forward network with low complexity and consistent performance.
method Joint optimization for layer and node estimation, low computational complexity, and use of lossless flow property and convex optimization.
result Consistent performance across Monte-Carlo trials and monotonically non-increasing cost with network growth.
We study consistency of learning algorithms for a multi-class performance metric that is a non-decomposable function of the confusion matrix of a classifier and cannot be expressed as a sum of losses on individual data points; examples of such performance metrics include the macro F-measure popular in information retri…
Enhances GANs by improving consistency regularization.
problem Improving the artifacts introduced by consistency regularization in GANs.
method Proposed modifications to consistency regularization to fix artifacts and improve performance.
result Significant improvement in FID scores on various GAN architectures.
Study dynamic risk measures and performance indices using distortion functions.
problem Investigate time consistency of dynamic risk measures and performance indices generated by distortion functions.
method Analyze dynamic coherent risk measures (DCRMs) and dynamic weighted value at risk measures, proving their equivalence. Establish properties of families of DCRMs generated by distortion functions and define corresponding dynamic coherent acceptability indices (DCAIs). Examine time consistency of DCRMs and DCAIs.
result DCRM generated by distortion functions are sub-martingale time consistent but not super-martingale time consistent and not weakly acceptance time consistent.
In this paper we provide a flexible framework allowing for a unified study of time consistency of risk measures and performance measures (also known as acceptability indices). The proposed framework not only integrates existing forms of time consistency, but also provides a comprehensive toolbox for analysis and synthe…
Study clusters Kenyan medical insurance companies based on financial performance and reporting consistency.
problem Identifying financial health and reporting consistency in Kenyan medical insurance companies.
method Advanced clustering techniques (KMeans, DTW) on financial ratios and time series data.
result Four distinct clusters identified, each representing different financial performance and reporting consistency combinations.
The paper explores conditions for predicting optimization performance.
problem Lack of formal theoretical guarantees linking prediction and optimization performance.
method Exploring conditions for asymptotic convergence and exact quantification of optimization performance.
result Explicit theoretical relationship between prediction and optimization performance.
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.
Proposes a new method for rank-consistent ordinal regression without weight-sharing constraints.
problem Ordinal response variables in real-world prediction problems are often ignored by conventional classification losses.
method CORN framework using conditional training sets and the chain rule for conditional probability distributions.
result Improves performance substantially compared to the CORAL reference approach without weight-sharing restrictions.
RLHF performs well despite violating social choice theory axioms.
problem RLHF's empirical success contradicts social choice theory axioms.
method Showed RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, and introduced new alignment criteria.
result RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, explaining its practical success.
New method improves consistency of reinforcement learning performance evaluations.
problem Inconsistent performance results in reinforcement learning due to flawed evaluation metrics.
method Proposes a new comprehensive evaluation methodology for reinforcement learning algorithms.
result Demonstrates improved reliability of performance measurements for reinforcement learning algorithms.
Measures consistency of tabular LLM predictions under fine-tuning multiplicity.
problem Conflicting predictions from fine-tuned tabular LLMs.
method Local stability measure in embedding space.
result Probabilistic guarantees on prediction consistency under multiplicity.
Bandit algorithms struggle with consistent performance and robustness.
problem Achieving consistent and robust performance in stochastic multi-armed bandit settings.
method Analyzing regret minimization trade-offs and proposing distribution-oblivious algorithms.
result Logarithmic regret is inconsistent and super-logarithmic regret is necessary for consistent learning.
Paper introduces new regression methods for consistent estimation of biophysical parameters.
problem Estimating biophysical parameters while respecting auxiliary variables.
method Linear and nonlinear kernel-based regression models with consistency constraints.
result Models provide closed-form solutions and successfully estimate chlorophyll content.
New framework improves generative models with prediction and consistency constraints.
problem Improving generative models with sparse labeled data.
method Optimizes variational autoencoders with prediction and consistency constraints.
result Promising image classification performance, especially in semi-supervised scenarios.
Improved diffusion models for inverse problems by integrating data consistency constraints.
problem Errors in earlier steps of diffusion models during posterior sampling.
method Guided Decoupled Posterior Sampling (GDPS) with data consistency constraint.
result GDPS achieves state-of-the-art performance, improving accuracy over existing methods.
Beam search improves UQ in LLMs by reducing duplicates and variance.
problem Peaked distributions in multinomial sampling lead to duplicates and high variance in uncertainty estimates.
method Employ beam search to generate candidates for consistency-based UQ, providing a theoretical lower bound and empirical evaluation.
result Beam search achieves smaller error than multinomial sampling, leading to state-of-the-art UQ performance.
CycleMorph improves image registration by preserving topology with cycle consistency.
problem Preserving original topology during deformation in image registration.
method Cycle-consistent deformable image registration approach.
result Effective and accurate registration on diverse image pairs within seconds.
Introduces new performance criteria for investment under distorted probabilities.
problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.
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.
Improved unsupervised word translation using adversarial autoencoder with cycle consistency and input reconstruction.
problem Challenging language pairs and lack of parallel data for unsupervised word translation.
method Adversarial autoencoder with cycle consistency and input reconstruction regularization.
result More stable and better performance than recent approaches.
New CNN method improves deconvolution microscopy without PSF measurement.
problem Computational expense and blind estimation in conventional deconvolution microscopy.
method Cycle consistent CNN with explicit PSF modeling layers for blind deconvolution.
result Algorithm robustness and efficacy confirmed through experimental results.
Proposes CI-GMVC to improve graph-based multi-view clustering performance.
problem Inconsistency in multi-view data affects clustering performance.
method Integrates consistent and inconsistent parts of multiple views using a unified matrix.
result Demonstrates improved clustering performance on real-world datasets.
Approximations of loopy belief propagation, including expectation propagation and approximate message passing, have attracted considerable attention for probabilistic inference problems. This paper proposes and analyzes a generalization of Opper and Winther's expectation consistent (EC) approximate inference method. Th…
Self-supervised regularization improves semi-supervised learning performance without requiring unlabeled data.
problem Improving semi-supervised learning performance with limited labeled data.
method Introducing self-supervised regularization as a new approach to combine unlabeled data features.
result Self-supervised regularization significantly improves semi-supervised performance on image classification benchmarks.
Paper proposes a new model using consistency regularization for learning from label proportions.
problem Learning from label proportions with weak labels on bags of instances.
method Consistency regularization applied to semi-supervised learning.
result LLP with consistency regularization achieves superior performance.
Improved VAEs learn consistent posterior distributions from missing data.
problem Learning VAEs from data with missing values, especially in the encoder.
method Formal definition of posterior consistency and regularization approach.
result Regularization leads to improved performance in reconstruction and downstream tasks.
As Machine Learning (ML) applications increase in data size and model complexity, practitioners turn to distributed clusters to satisfy the increased computational and memory demands. Unfortunately, effective use of clusters for ML requires considerable expertise in writing distributed code, while highly-abstracted fra…
The paper examines the consistency of Lasso regression applied to signature analysis of time series data.
problem Consistency of Lasso regression in signature analysis of time series data.
method The paper studies the consistency of Lasso regression applied to signature analysis of time series data, both theoretically and numerically.
result The Lasso regression is consistent both asymptotically and in finite sample for certain types of time series and processes.
FixMatch combines consistency and confidence to simplify semi-supervised learning.
problem Improving model performance with unlabeled data.
method Generates pseudo-labels using weak augmentation, retains high-confidence predictions, trains on strongly augmented images.
result Achieves state-of-the-art performance on semi-supervised learning benchmarks.
The study analyzes consistency-based SSL methods and proposes a new framework.
problem Improving performance in semi-supervised learning with minimal labeled data.
method Analysis of consistency-based SSL methods, including the Π-model, and proposing a new framework. result A simple extension of the Hidden Manifold Model that incorporates data-augmentation schemes.
Enhash detects concept drift in data streams quickly and efficiently.
problem Detecting abrupt, gradual, virtual, or recurring events in data streams.
method Uses projection hash to insert incoming samples and detects concept drift.
result Enhash has competitive performance and moderate resource requirements compared to existing ensemble learners.
New method for robust regression with near-optimal performance even with high corruption rates.
problem Robust linear regression with response variable corruptions.
method Adaptive hard thresholding for consistent estimation.
result Near-optimal consistent estimation of the true regression vector with 1−o(1) fraction of corruptions.