CSI method learns conditional distributions by estimating flow equations.
problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.
A new method for learning conditional distributions using ODEs and neural networks.
problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.
Coercivity condition ensures learning of interacting particle systems.
problem Ensuring identifiability of interaction functions in learning systems of interacting particles.
method Equivalence of coercivity condition to strictly positive definiteness of an integral kernel.
result For ergodic systems, the integral kernel is strictly positive definite, satisfying the coercivity condition.
The speed with which a learning algorithm converges as it is presented with more data is a central problem in machine learning --- a fast rate of convergence means less data is needed for the same level of performance. The pursuit of fast rates in online and statistical learning has led to the discovery of many conditi…
Current meta-learning approaches focus on learning functional representations of relationships between variables, i.e. on estimating conditional expectations in regression. In many applications, however, we are faced with conditional distributions which cannot be meaningfully summarized using expectation only (due to e…
Study on estimating conditional risk in machine learning.
problem Estimating expected loss of prediction models given input features.
method Analyzed in classification and regression settings, showing equivalence to standard regression. Developed theoretical insights and empirical validation.
result Conditional risk calibration is distinct from existing uncertainty quantification problems.
Generates samples conditioned on labels using optimal transport.
problem Estimating conditional distributions for specific labels.
method Wasserstein geodesic generator based on optimal transport theory.
result Learned conditional distributions and optimal transport maps.
A new EM framework for goal-conditioned RL improves performance on sparse reward tasks.
problem Handling sparse rewards in goal-conditioned reinforcement learning.
method A graphical model framework with an EM algorithm that includes a learning-in-hindsight E-step and a supervised M-step.
result hEM significantly outperforms model-free baselines on goal-conditioned benchmarks with sparse rewards.
New method improves meta-learning performance by task-specific initialization.
problem Difficulties in generalizing and achieving theoretical guarantees in conditional meta-learning.
method Structured prediction approach for task-specific initialization.
result TASML improves performance of existing meta-learning models.
A new method uses Schrödinger bridges for deep conditional generative learning.
problem Learning conditional distributions with additional information.
method Schrödinger bridge approach with discretized SDE and deep neural network.
result Generated samples have higher quality and can estimate conditional density.
Many machine learning tasks, such as learning with invariance and policy evaluation in reinforcement learning, can be characterized as problems of learning from conditional distributions. In such problems, each sample x itself is associated with a conditional distribution p(z∣x) represented by samples $\{z_i\}_{i=1…
Paper improves sample efficiency of transfer learning in diffusion models.
problem Diffusion models need too much data to train from scratch.
method Assumes shared low-dimensional representation across tasks for improved sample efficiency.
result Sample complexity of target tasks can be reduced with a well-learned representation.
We identify conditional parity as a general notion of non-discrimination in machine learning. In fact, several recently proposed notions of non-discrimination, including a few counterfactual notions, are instances of conditional parity. We show that conditional parity is amenable to statistical analysis by studying ran…
Proposes a new method for big portfolio selection using graph-based conditional moments.
problem Challenges in selecting portfolios for thousands of stocks.
method Graph-based Conditional Moments (GRACE) method: learns quantiles, means, variances, skewness, and kurtosis of stock returns.
result Shows superior performance compared to competitors, especially in measures of conditional variance, skewness, and kurtosis.
Proposes a method to learn conditional VAEs from datasets with missing covariates.
problem Learning conditional VAEs from datasets with missing covariates.
method Augments conditional VAEs with a prior distribution for missing covariates and estimates their posterior using amortised variational inference.
result The proposed method outperforms previous methods in learning conditional VAEs from non-temporal, temporal, and longitudinal datasets.
LCIT tests conditional independence using latent representations.
problem Detecting conditional independencies in statistical and machine learning tasks.
method Generative framework for learning latent representations of target variables X and Y, then testing for remaining dependencies.
result LCIT outperforms state-of-the-art baselines consistently under different metrics and settings.
The outcome of Jacobian singular values regularization was studied for supervised learning problems. It also was shown that Jacobian conditioning regularization can help to avoid the ``mode-collapse'' problem in Generative Adversarial Networks. In this paper, we try to answer the following question: Can information abo…
Paper proposes a method for estimating tropical cyclone intensity distribution using deep learning.
problem Lack of full accounting of prediction variability in single-point forecasts.
method Smooth model over target and covariates, logistic transformation for conditional density, case-control sampling approximation.
result Method provides insights into predicted response behavior, improving decision-making and policy.
Method learns conditional distributions using neural entropic optimal transport.
problem Challenges in learning multiple conditional distributions.
method Neural entropic optimal transport method with two networks and regularization.
result Effective learning of conditional distributions with limited samples.
We introduce a new model for building conditional generative models in a semi-supervised setting to conditionally generate data given attributes by adapting the GAN framework. The proposed semi-supervised GAN (SS-GAN) model uses a pair of stacked discriminators to learn the marginal distribution of the data, and the co…
A novel approach learns goal-conditioned policies for locomotion using batch RL.
problem Training goal-conditioned policies for rotation invariant locomotion.
method Data augmentation and Siamese framework for invariance.
result Our approach outperforms existing RL algorithms on 3D locomotion agents.
This paper introduces a neural operator for probabilistic conditioning.
problem Probabilistic conditioning of random variables X given Y. method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.
New framework for learning with class-conditional multi-label noise.
problem Class labels corrupted with conditional probabilities for multiple labels.
method Formalized as CCMN framework, established unbiased estimators, proved consistency with multi-label loss functions, implemented partial multi-label learning method.
result Effectiveness validated on multiple datasets and metrics.
Improved complexity for machine learning optimization methods.
problem Optimizing over-parametrized models in machine learning.
method Stochastic conditional gradient methods with interpolation-like conditions.
result Improved oracle complexities for finding optimal solutions.
Unified framework for structure learning via conditional independence testing.
problem Optimal structure learning and conditional independence testing.
method Established a fundamental connection and reduction between structure learning and conditional independence testing.
result Optimal rates for structure learning are determined by conditional independence testing rates.
Proposes a new method for improved conformal prediction.
problem Inability to construct nontrivial prediction sets with full conditional coverage guarantees.
method Partition Learning Conformal Prediction (PLCP) framework to improve conditional validity through learning uncertainty-guided features.
result PLCP provides superior performance in terms of coverage and length compared to state-of-the-art methods.
Sharp statistical theory for conditional diffusion models.
problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.
NCP uses neural networks to efficiently learn conditional distributions.
problem Learning conditional distributions for statistical inference.
method Neural Conditional Probability (NCP) approach.
result NCP efficiently handles complex probability distributions and matches leading methods.
New coverage conditions improve sample efficiency in online reinforcement learning.
problem Improving sample efficiency in online reinforcement learning with function approximation.
method Identifying and studying new coverage conditions for online reinforcement learning.
result Improved regret bounds achieved with new coverage conditions.
Conditional meta-learning improves meta-learning performance in diverse task environments.
problem Meta-learning struggles with tasks that have heterogeneous complexity.
method Conditional meta-learning infers a task-specific meta-parameter vector.
result Conditional meta-learning outperforms standard meta-learning in diverse task environments.
New method uses machine learning to improve statistical inference.
problem Performing inference on conditional functionals with scarce labeled data.
method Combines localization with prediction-based variance reduction.
result Valid and sharp confidence intervals for conditional functionals.
CAN learns conditional and interventional distributions from unlabeled data.
problem Learning conditional and interventional distributions from unlabeled data.
method CAN framework with LGN and CIGN architectures, equipped with an intervention mechanism.
result CAN generates both interventional and conditional samples without needing the causal graph.
Proposes data-driven methods for estimating conditional expectations.
problem Estimating conditional expectations when underlying density is unknown.
method Data-driven techniques to directly estimate conditional expectations from training data.
result Extends data-driven method to solve nonlinear equations in stochastic optimization.
This paper proposes a semi-conditional normalizing flow model for semi-supervised learning. The model uses both labelled and unlabeled data to learn an explicit model of joint distribution over objects and labels. Semi-conditional architecture of the model allows us to efficiently compute a value and gradients of the m…
New model improves transfer learning and semi-supervised learning.
problem Improving transfer learning and semi-supervised learning performance.
method Developed a new conditional energy-based model (ICE-BeeM) based on nonlinear ICA.
result Identifiable representations learned by ICE-BeeM improve performance in transfer learning and semi-supervised learning tasks.
Neural-Kernel CME tackles scalability and expressiveness challenges in conditional distribution representation.
problem Scalability and expressiveness challenges in kernel conditional mean embeddings.
method Combines deep learning with CMEs using a neural network optimization framework.
result Achieves competitive and often superior performance in conditional density estimation and RL.
Proposes a method to forecast non-stationary time series.
problem Challenges of non-stationary conditional distributions in deep learning.
method Bayesian dynamic model + deep conditional distribution model.
result Adapts to non-stationary time series better than state-of-the-art solutions.
We present a new replay-based method of continual classification learning that we term "conditional replay" which generates samples and labels together by sampling from a distribution conditioned on the class. We compare conditional replay to another replay-based continual learning paradigm (which we term "marginal rep…
A novel framework uses goal-conditioned reinforcement learning to generate diverse samples.
problem Generating high-quality, diverse samples from generative models.
method Two agents: GC-agent learns to reconstruct the training set, S-agent learns to imitate GC-agent without knowing the goals.
result Empirically, the method generates diverse and high-quality samples in image synthesis.
Paper tackles efficient risk estimation under dataset shift conditions.
problem Limited data from target population; auxiliary data available.
method Semiparametric efficiency theory; efficient and multiply robust estimators.
result Developed estimators for various dataset shift conditions.
Theoretical analysis shows pretext-based self-supervised learning can be boosted by downstream data under certain conditions.
problem Theoretical analysis of pretext-based self-supervised learning and downstream data refinement.
method Theoretical analysis and experiments on synthetic and real-world datasets.
result Theoretical lower bounds and experiments show that downstream data refinement can boost or hurt performance depending on conditions.
Generative neural nets learn deep policies conditioned on goals.
problem Learning optimal policies for specific goals in reinforcement learning.
method Goal-conditioned neural nets that generate deep neural policies.
result Single learned policy generator can achieve any desired return.
Improves full conformal prediction for stochastic non-conformity measures.
problem Inability of existing conditions to guarantee full conformal prediction validity under stochastic settings.
method Introduces a new sufficient condition: Conditional Independence & Permutation Invariance in Distribution.
result Corrects the insufficient condition and provides a new sufficient condition for full conformal prediction validity.
MCD reformulates conditional density estimation into binary classification.
problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.
New recursive algorithm estimates conditional kernel mean embeddings in Hilbert space.
problem Estimating conditional distributions in RKHS for supervised learning.
method Recursive algorithm in L2 space for conditional kernel mean map. result Strong L2 consistency of recursive estimator proved. S2cGAN uses fewer labels to train cGANs effectively.
problem Training conditional GANs requires expensive labelled data.
method Semi-supervised training with sparse labels and unsupervised data.
result S2cGAN learns conditional mapping with sparse labels and unconditional distribution with unsupervised data.
New insights into correntropy-based regression reveal robustness and unified approaches.
problem Learning robust regression functions under additive noise.
method Minimum distance estimation and conditional mean, mode, median functions.
result Unified approach to conditional mean, mode, and median functions.
Unified approach for nonparametric regression and conditional distribution learning.
problem Nonparametric regression and conditional distribution learning problems.
method Generative learning framework with deep neural networks to estimate a conditional generator.
result The approach estimates a regression function and a conditional generator simultaneously, providing good prediction intervals.