Continuous time framework for discrete data denoising models.
problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.
ORDisCo learns from unlabeled data to improve semi-supervised continual learning.
problem Lack of effective use of unlabeled data in semi-supervised continual learning.
method Deep Online Replay with Discriminator Consistency (ORDisCo) that continually passes the learned data distribution to a classifier and selectively stabilizes discriminator parameters.
result Significant performance improvement on various semi-supervised learning benchmark datasets.
New algorithm estimates semi-continuous data density using entropy maximization.
problem Estimating density functions for semi-continuous data.
method Maximum entropy principle, requiring only constraint function samples.
result Estimate has significantly less bias compared to existing methods.
Paper proposes copula-based models for analyzing multivariate zero-inflated continuous data.
problem Challenges in analyzing multivariate zero-inflated continuous data with mixed discreteness and continuity.
method Proposes two copula-based density estimation models and rectified Gaussian copula.
result Demonstrates superior performance compared to conventional methods.
Estimating causal models from observational data is a crucial task in data analysis. For continuous-valued data, Shimizu et al. have proposed a linear acyclic non-Gaussian model to understand the data generating process, and have shown that their model is identifiable when the number of data is sufficiently large. Howe…
Study of continuous symmetries in Nahm data and BPS monopoles.
problem Solutions to Nahm's equations with continuous symmetries.
method Classification of Ansätze and construction of Nahm data.
result Construction of new BPS monopoles with spherical symmetry.
The study tackles modeling high-frequency financial data using continuous distributions, finding them inadequate.
problem Challenges in modeling high-frequency integer price changes with continuous distributions.
method Proposed a modified maximum likelihood estimation procedure to account for the discreteness of high-frequency price changes.
result Traditional GARCH models are not suitable for high-frequency data due to the discreteness of price changes.
Prototype-based generative replay framework for online continual regression.
problem Addressing the challenge of non-stationary data streams in regression tasks.
method Adaptive output-space discretization model for prototype-based generative replay.
result Reduces forgetting and provides more stable performance.
A new clustering model for mixed datasets combines continuous and non-continuous data.
problem Challenges in clustering mixed data due to heterogeneous variables.
method Mixed Deep Gaussian Mixture Model (MDGMM) with multilayer architecture.
result Automatic selection of model specifications and optimal number of clusters.
Proves Hölder continuity of complex Monge-Ampère solutions.
problem Global Hölder continuity of solutions to complex Monge-Ampère equation.
method Analyzes Dirichlet problem on strictly pseudoconvex domains or Hermitian manifolds.
result Proves global Hölder continuity of solutions under given conditions.
Develops a framework for continual learning in anomaly detection.
problem Deterioration of monitoring performance due to new defect categories.
method Pseudo replay-based class incremental learning with oversampling.
result Enhanced monitoring performance and flexibility in model architecture.
CANDI solves the gap between continuous and discrete diffusion models for text generation.
problem Underperformance of continuous diffusion models in discrete data domains.
method Introduces token identifiability and a hybrid framework (CANDI) to decouple discrete and continuous corruption.
result CANDI successfully avoids temporal dissonance, enabling continuous diffusion benefits for discrete spaces.
Bilevel Continual Learning improves continual learning by transferring knowledge effectively.
problem Catastrophic forgetting and poor generalization in continual learning.
method Bilevel optimization and dual memory management strategies.
result BCL achieves effective knowledge transfer and alleviates catastrophic forgetting.
Bayesian approach helps update deep models without forgetting past data.
problem Updating deep models sequentially without forgetting past data.
method Bayesian inference for continual learning.
result Bayesian approach enables updating model beliefs with new data.
Continuous-time algorithms improve online learning performance.
problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.
Proposes a framework for semi-supervised continual learning from sequentially arriving data.
problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.
Neural networks learn discrete tasks on continuous data via emergent geometry.
problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.
DFMs enable flow-based models for multimodal discrete and continuous data.
problem Combining discrete and continuous data for generative models.
method Discrete Flow Models (DFMs) using Continuous Time Markov Chains.
result DFMs achieve state-of-the-art co-design performance for protein structure and sequence generation.
This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
The article recovers tensor fields from partial data using weighted divergent ray transforms.
problem Recovering tensor fields from partial data.
method Weighted divergent ray transforms, unique continuation property of fractional Laplacian, explicit reconstruction formulas.
result Recovery of symmetric m-tensor fields and unique continuation for vector fields and symmetric 2-tensor fields. CLPF models continuous time-series data with improved representational power and variational approximations.
problem Fitting continuous time-series data with existing models faces challenges in representational power and variational quality.
method CLPF uses a time-dependent normalizing flow driven by a stochastic differential equation to decode continuous latent processes into continuous observables. Maximum likelihood optimization is achieved through a novel variational posterior process.
result CLPF outperforms state-of-the-art baselines on synthetic and real-world time-series data.
Generative replay improves continual learning by using generated data as negative examples.
problem Catastrophic forgetting in continual learning.
method Using generative models to provide negative examples for new classes.
result Generative replay can improve learning new classes even when existing approaches fail.
Study develops method for estimating causal effects in continuous variables.
problem Lack of methods for estimating causal effects in continuous variables.
method Develops a method independent of data generating models for continuous variable interventions.
result Preserves identifiability of data and applies to any generating models.
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the dat…
Study on Hölder continuity of complex Monge-Ampère solutions on Stein spaces.
problem Understanding continuity of solutions to complex Monge-Ampère equations on Stein spaces.
method Analyzing solutions with Lp densities and Hölder boundary data on Stein spaces with isolated singularities. result Solutions are Hölder continuous outside singular points if boundary data is Hölder continuous.
Improved density estimation for mixed discrete-continuous data.
problem Inconsistent density estimation for mixtures of continuous and discrete data.
method Modification of existing nonparametric density estimation methods to handle mixed discrete-continuous data.
result Improved consistency and empirical performance for mixed discrete-continuous data.
Adaptive tensor modeling preserves continuity in multidimensional data.
problem Discretization of continuous multidimensional data loses important information.
method Functional Tucker decomposition (FTD) with RKHS modeling.
result FTD enables adaptive and expressive tensor modeling.
Generative models learn distributions of continuous functions.
problem Training generative models on discretized grids limits model size and data type.
method Parameterize data points by continuous functions, learn distributions over these functions.
result Models can learn rich distributions of functions independently of data type and resolution.
Graph Beta Diffusion (GBD) generates graphs with mixed discrete and continuous components.
problem Generating graphs with mixed discrete and continuous components.
method Introduces Graph Beta Diffusion (GBD) using a beta diffusion process.
result Competes strongly with existing models across graph benchmarks.
We solve the Dirichlet problem for the complex Monge-Ampère equation on a strictly pseudoconvex with the right hand side being a positive Borel measure which is dominated by the Monge-Ampère measure of a Hölder continuous plurisubharmonic function. If the boundary data is continuous, then the solution is continuous. If…
Application of discrete-time survival methods for continuous-time survival prediction is considered. For this purpose, a scheme for discretization of continuous-time data is proposed by considering the quantiles of the estimated event-time distribution, and, for smaller data sets, it is found to be preferable over the …
Proposes DeepSDRF for continuous treatment recommendation from clinical survival data.
problem Continuous treatment recommendation in medical settings with survival data.
method Deep Survival Dose Response Function (DeepSDRF) for learning conditional average dose response (CADR) function.
result Similar performance of recommender algorithms based on random search and reinforcement learning.
Artificial neural networks have exceeded human-level performance in accomplishing several individual tasks (e.g. voice recognition, object recognition, and video games). However, such success remains modest compared to human intelligence that can learn and perform an unlimited number of tasks. Humans' ability of learni…
New tensor network models learn continuous data effectively.
problem Tensor network models' limitations in handling continuous data.
method Developed a new family of tensor network generative models for continuous data.
result Models can approximate any reasonably smooth probability density function with arbitrary precision.
Discond-VAE separates continuous and discrete factors in data.
problem Separating shared and class-specific variations in real-world data.
method Introduces private and public latent variables to represent continuous and discrete factors, respectively.
result Discond-VAE successfully disentangles class-dependent continuous factors from discrete factors.
Synthetic continued pretraining enhances model performance with synthetic data.
problem Data inefficiency in pretrained models when adapting to domain-specific documents.
method Synthetic data augmentation using EntiGraph to create a large synthetic corpus.
result Language models can answer questions and follow instructions without access to domain-specific documents.
Unique continuation for X-ray transforms of one-forms with partial data.
problem Proving unique continuation for X-ray transforms of one-forms with limited data.
method Proved unique continuation for the normal operator of X-ray transforms of one-forms, leading to partial data results.
result Unique continuation for X-ray transforms of one-forms with partial data.
Proposes a new convolutional neural network for non-grid data.
problem Limited applicability of standard CNNs to non-grid structured data.
method Introduces Parametric Continuous Convolution (PCC) with learnable kernel functions.
result Significant improvement in point cloud segmentation and lidar motion estimation.
Modyn automates continuous ML model training on growing datasets.
problem Continuous model retraining is costly and impractical.
method Data-centric ML platform with policies for continuous training.
result Modyn enables high throughput training with sample-level data selection.
Bayesian Federated Learning improves model reliability in dynamic environments.
problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.
Proposes DMOC for more nuanced neural network robustness.
problem Lipschitz continuity is too coarse for nuanced data-dependent behavior.
method Data-driven, architecture-agnostic framework based on DMOC.
result DMOC provides a finer notion of robustness relative to data distribution.
JME continually estimates data moments privately and accurately.
problem Private and accurate continual estimation of data moments.
method Uses matrix mechanism and joint sensitivity analysis.
result Improves accuracy in estimating mean and covariance with reduced noise.
Proposes Mv-TCNN for continual learning without known tasks in advance.
problem Catastrophic forgetting in continual learning.
method Multi-view Task Conditional Neural Networks (Mv-TCNN).
result Outperforms state-of-the-art continual learning models.
D-CBRS manages memory for continual learning by accounting for intra-class diversity.
problem Forgetting in continual learning, especially with class-imbalanced data.
method D-CBRS introduces a novel approach to store instances in memory, considering intra-class diversity.
result D-CBRS outperforms existing methods on data sets with intra-class diversity.
Develops scalable methods to assess sensitivity and uncertainty in continuous treatment effects.
problem Estimating effects of continuous-valued interventions from observational data, especially when ignorability and positivity assumptions are violated.
method Continuous treatment-effect marginal sensitivity model (CMSM), scalable algorithm, uncertainty-aware deep models.
result Derives bounds that agree with observed data and a defined level of hidden confounding.
Flow based models such as Real NVP are an extremely powerful approach to density estimation. However, existing flow based models are restricted to transforming continuous densities over a continuous input space into similarly continuous distributions over continuous latent variables. This makes them poorly suited for m…
We present a framework for learning disentangled and interpretable jointly continuous and discrete representations in an unsupervised manner. By augmenting the continuous latent distribution of variational autoencoders with a relaxed discrete distribution and controlling the amount of information encoded in each latent…