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.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “consistent generation”
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.
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.
This paper aims to analyze knowledge consistency between pre-trained deep neural networks. We propose a generic definition for knowledge consistency between neural networks at different fuzziness levels. A task-agnostic method is designed to disentangle feature components, which represent the consistent knowledge, from…
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…
Clustering processescs.LG
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…
Clustering processescs.LG
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…
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.
Consistency Modelscs.LG
Consistency models generate high-quality samples fast and without iterative sampling.
problem Slow generation in diffusion models.
method Direct mapping of noise to data, supporting fast one-step generation and multistep sampling.
result Consistency models achieve state-of-the-art FID scores and outperform diffusion models in one-step generation.
New algorithm achieves consistent learning from context in bandit problems.
problem Learning from context in bandit problems with non-i.i.d. contexts.
method Optimistically universal learning rule balancing generalization and personalization.
result Achieves universal consistency for large classes of non-i.i.d. contexts.
MaxMatch improves SSL with worst-case consistency for better generalization.
problem Efficiently supervised learning with unlabeled data.
method Worst-case consistency regularization for SSL, providing a bound and an algorithm.
result The proposed method converges to a stationary point and improves generalization.
Study improves -consistency bounds for regression analysis.
problem Improving -consistency bounds for regression analysis.
method Generalized theorems and novel -consistency bounds for various surrogate loss functions.
result Derives principled surrogate losses for adversarial regression.
Study uniform consistency in nonparametric mixture models and mixed regression.
problem Uniform consistency in nonparametric mixture models and mixed regression models.
method Construct uniformly consistent estimators under general conditions, develop novel technical tools.
result Prove uniform consistency results for nonparametric mixtures and mixed regression models.
GES algorithm improves consistency for nonparametric DAG models.
problem Consistent estimation of nonparametric DAG models.
method Greedy equivalence search with new consistency proof for nonparametric families.
result Consistency of GES for general nonparametric DAG models with smooth factorization.
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.
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 -consistency and Bayes-consistency of specific surrogate losses.
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.
We extend a recently proposed 1-nearest-neighbor based multiclass learning algorithm and prove that our modification is universally strongly Bayes-consistent in all metric spaces admitting any such learner, making it an "optimistically universal" Bayes-consistent learner. This is the first learning algorithm known to e…
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.
This paper investigates Frequentist consistency properties of the posterior distributions constructed via Generalized Variational Inference (GVI). A number of generic and novel strategies are given for proving consistency, relying on the theory of -convergence. Specifically, this paper shows that under minimal regul…
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 -consistency, -consistency bounds, and Bayes-consistency for deferral learning.
ADCMs adaptively discretize CMs for efficient training.
problem Manual discretization schemes cause repeated adjustments for different noise schedules and datasets.
method Unified framework with optimization problem, local and global consistency constraints, and Gauss-Newton method.
result Significantly improve training efficiency and generative performance of CMs.
Working in a continuous time setting, we extend to the general case of dynamic risk measures continuous from above the characterization of time consistency in terms of ``cocycle condition'' of the minimal penalty function. We prove also the supermartingale property for general time consistent dynamic risk measures. Whe…
Study assesses consistency and reproducibility of LLMs in finance and accounting tasks.
problem Consistency and reproducibility of LLM outputs in finance and accounting research.
method Extensive experimentation with 50 independent runs across 5 tasks using 3 OpenAI models.
result Task-specific patterns of consistency and reproducibility, with binary classification and sentiment analysis achieving near-perfect reproducibility.
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.
This paper establishes the asymptotic consistency of the {\it loss-calibrated variational Bayes} (LCVB) method. LCVB was proposed in~\cite{LaSiGh2011} as a method for approximately computing Bayesian posteriors in a `loss aware' manner. This methodology is also highly relevant in general data-driven decision-making con…
Motion of curves and surfaces in lead to nonlinear evolution equations which are often integrable. They are also intimately connected to the dynamics of spin chains in the continuum limit and integrable soliton systems through geometric and gauge symmetric connections/equivalence. Here we point out the fact that…
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…
Study on calibration and consistency of adversarial surrogate losses.
problem Designing robust classifiers with theoretical guarantees.
method Extensive analysis of H-calibration and H-consistency of adversarial surrogate losses.
result Some convex loss functions and supremum-based convex losses are not H-calibrated for important hypothesis sets.
New theorem for generalized group sparsity improves consistency and convergence rates.
problem Improving statistical inference in high-dimensional data with element-wise and group-wise sparsity.
method Developed a generalized version of Sparse-Group Lasso and proved a universal theorem for consistency and convergence rates.
result Obtained results on consistency and convergence rates for different forms of double sparsity regularization.
The paper examines Nash equilibrium in GANs for stationary Gaussian processes.
problem Existence and uniqueness of Nash equilibrium in GANs for stationary Gaussian processes.
method Analyzes the existence of Nash equilibrium in GANs for stationary Gaussian processes, considering different discriminator families.
result The existence of Nash equilibrium depends on the discriminator family and symmetry properties of the generator family.
New framework for consistent submodular maximization with insertions and deletions.
problem Maintaining near-optimal solutions in a dynamic setting with insertions and deletions.
method Developed a general framework for fully dynamic submodular maximization, instantiated for cardinality and rank-k matroid constraints.
result First constant-factor approximations with sublinear consistency for both cardinality and rank-k matroid constraints.
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.
Universal consistency and rates of convergence of multiclass prototype algorithms in metric spacescs.LG
Prototype rules simplify multiclass classification in metric spaces, achieving consistency and reduced complexity.
problem Multiclass classification in metric spaces, focusing on universal consistency and convergence rates.
method Novel Proto-NN and hybrid rules for multiclass classification in metric spaces, analyzing convergence rates.
result Proto-NN is universally consistent and simpler to implement, with similar computational advantages.
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 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.
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is provably impossible. However, it is shown that a consistent clustering method may …
Consistent partial identification of causal effects proved for neural models.
problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.
New rule universally consistent for online learning with non-ergodic data.
problem Online learning with non-ergodic data processes.
method Developed an online learning rule for processes on (X,Y) pairs.
result Generalizes past results to non-ergodic processes on (X,Y).
Regularized M-estimators are used in diverse areas of science and engineering to fit high-dimensional models with some low-dimensional structure. Usually the low-dimensional structure is encoded by the presence of the (unknown) parameters in some low-dimensional model subspace. In such settings, it is desirable for est…
The problem for consistency between linear transports along paths and real bundle metrics in real vector bundles is stated. Necessary and/or sufficient conditions, as well as conditions for existence, for such consistency are derived. All metrics (resp. transports) consistent with a given transport (resp. metric) are e…
New CycleGAN uses invertible generator for faster, less resource-intensive CT denoising.
problem Efficient unsupervised CT denoising without paired data.
method Single generator with wavelet residual domain, no discriminators, cycle consistency via invertible generator.
result Significantly improved denoising performance with faster training and less parameters.
SCR improves GNN training with consistency regularization.
problem Balancing labeled and unlabeled data in GNNs.
method Introduces two consistency regularization strategies: perturbed predictions and Mean Teacher.
result Enhances various GNNs to achieve better performance.
Gini index needs auto-calibration for consistent decision-making.
problem Gini index's inconsistency in decision-making.
method Restrict Gini index to auto-calibrated regression models.
result Gini index becomes strictly consistent with auto-calibration.
Consistency distillation reduces memorization in diffusion models without harming sample quality.
problem Understanding how distillation affects memorization in diffusion models.
method Analysis of consistency distillation in diffusion models using a random feature neural network model.
result Consistency distillation reduces memorization in diffusion models without harming sample quality.
We introduce Fisher consistency in the sense of unbiasedness as a desirable property for estimators of class prior probabilities. Lack of Fisher consistency could be used as a criterion to dismiss estimators that are unlikely to deliver precise estimates in test datasets under prior probability and more general dataset…
EnScale: Temporally-consistent multivariate generative downscaling via proper scoring rulesphysics.ao-ph
EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.
problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.
Enhanced -consistency bounds derived under relaxed conditions.
problem Quantifying the relationship between zero-one estimation error and surrogate loss estimation error.
method Relaxing the condition on the surrogate loss conditional regret and presenting a general framework for establishing enhanced -consistency bounds.
result Derivation of more favorable -consistency bounds in various scenarios.
New method interpolates training data and is consistent for various data distributions.
problem Establishing generalization guarantees for ensemble methods in the interpolating regime.
method Developed manifold-Hilbert kernel for Riemannian manifolds and used it in ensemble classification.
result Consistent ensemble classification method for broad data distributions.