New RBM method for missing data inference, comparing performance to existing methods.
problem Missing data inference and perception-distortion trade-off.
method Linearization of RBM effective energy function for missing data.
result Proposed method outperforms existing reconstruction procedures in missing data inference.
Optimal defenses protect FL models from gradient reconstruction attacks.
problem Gradient reconstruction attacks compromise FL models by recovering original data from shared gradients.
method Derive a theoretical lower bound of reconstruction error, customize noise and pruning defenses, and achieve optimal trade-off between leakage and utility.
result Our methods outperform Gradient Noise and Pruning in protecting training data and maintaining model utility.
Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.
problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.
DynAE improves deep clustering by dynamically shifting from reconstruction to centroid construction.
problem Lack of clear cost functions in unsupervised learning for capturing variations and similarities.
method Dynamic Autoencoder (DynAE) that gradually eliminates reconstruction in favor of centroid construction.
result DynAE achieves state-of-the-art results in deep clustering compared to other methods.
Paper evaluates and mitigates privacy risks in deep learning models.
problem Quantifying and defending against privacy attacks in deep learning.
method Quantitative evaluation of trade-offs, reformulating attacks, and proposing a novel SPN.
result Model accuracy improved by 5-20% while maintaining data privacy.
GCVAE improves disentanglement in VAEs while balancing reconstruction error.
problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.
Deep learning models reconstruct volatility surfaces from noisy data under no-arbitrage constraints.
problem Reconstructing implied volatility surfaces from sparse and noisy option quotes.
method Compared multiple neural architectures including Transformers, U-Nets, and variational autoencoders.
result Transformer and U-Net architectures achieve strong reconstruction accuracy, especially under sparse observation regimes.
Optimizing noise variance in VAEs balances reconstruction quality and prior regularisation.
problem Balancing reconstruction quality and prior regularisation in VAEs.
method Learning the noise variance in the Gaussian likelihood to balance the ELBO loss.
result Optimizing noise variance improves VAE-generated sample quality and uncertainty.
Paper addresses data reconstruction from privacy-protected templates using STCA.
problem Reconstructing privacy-sensitive data from protected templates.
method Sparse ternary coding with ambiguization (STCA) for privacy preservation.
result STCA maintains theoretical performance against deep reconstruction attacks for synthetic data but requires special measures for real images.
DynamicVAE improves disentanglement and reconstruction accuracy without sacrificing one for the other.
problem The inherent trade-off between disentanglement and reconstruction accuracy in VAE models.
method DynamicVAE uses a modified incremental PI controller to dynamically adjust the weight β during training, decoupling disentanglement and reconstruction accuracy.
result DynamicVAE significantly improves reconstruction accuracy while maintaining disentanglement comparable to existing methods.
Improves disentangled representation learning with multi-stage modeling.
problem Trade-off between disentanglement and reconstruction quality in autoencoders.
method Penalty-based disentanglement learning followed by detail information modeling.
result Higher reconstruction quality than state-of-the-art methods with equivalent disentanglement.
A new method reduces dimensionality for better likelihood-free parameter estimation.
problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.
In this work we investigate approaches to reconstruct generator models from measurements available at the generator terminal bus using machine learning (ML) techniques. The goal is to develop an emulator which is trained online and is capable of fast predictive computations. The training is illustrated on synthetic dat…
ADEC addresses feature randomness and drift in autoencoder-based clustering.
problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.
This paper tackles fairness in PCA by balancing it with reconstruction error.
problem Fairness concerns in PCA due to different group representation errors.
method A multi-objective optimization approach to balance fairness and reconstruction error.
result Achieving fairness with minimal loss in reconstruction error.
Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.
problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.
VAE struggles with distribution class sharpness, which can be learned dynamically.
problem VAE struggles with distribution class sharpness, leading to blurry reconstructions.
method Established that VAE fails if distribution class sharpness does not match data scale. Suggested learning distribution sharpness dynamically.
result Dynamic adjustment of distribution sharpness improves VAE performance, escaping local optima.
Enhances deep neural networks for MRI reconstruction by increasing expressivity.
problem Balancing network complexity and performance in deep learning MRI reconstruction.
method Geometric approach using bootstrapping and subnetwork aggregation with attention module.
result Significant improvement in MRI reconstruction performance with minimal complexity increase.
New unsupervised deep learning method improves temporal resolution in tMRA.
problem Limited temporal resolution in tMRA due to fixed view-sharing scheme.
method Optimal transport driven cycle-consistent generative adversarial network (cycleGAN) without fully sampled k-space reference data.
result Can generate high quality reconstructions at various temporal resolutions.
Deep learning solves imaging inverse problems without ground truth.
problem Solving imaging problems without perfect data.
method Taxonomy of deep learning approaches for imaging inverse problems.
result Trade-offs and failure modes identified for different methods.
Medical image reconstruction advances from sparse models to machine learning.
problem Improving image quality and reducing noise in medical imaging.
method Iterative reconstruction, modified data acquisition methods, and machine learning models.
result Machine learning methods show promise in improving image quality.
New method speeds up kernel-based machine learning for force field reconstruction.
problem Scalability issues in kernel-based machine learning for force field reconstruction.
method Nyström-type methods to construct preconditioners based on low-rank approximations of the kernel matrix.
result Effective preconditioners lead to super-linear convergence in kernel-based machine learning.
We define and address the problem of unsupervised learning of disentangled representations on data generated from independent factors of variation. We propose FactorVAE, a method that disentangles by encouraging the distribution of representations to be factorial and hence independent across the dimensions. We show tha…
Proposes a fair PCA algorithm that balances reconstruction loss and fairness.
problem PCA can be unfair to different groups.
method Adaptive first-order algorithm for Pareto optimality.
result The algorithm finds a fair subspace that minimizes reconstruction loss.
We propose a fair principal component analysis method that balances reconstruction error and subgroup fairness.
problem Fairness and robustness in principal component analysis for consequential domains.
method Distributionally robust optimization over the Stiefel manifold with a Riemannian subgradient descent.
result The proposed method achieves better performance on real-world datasets compared to state-of-the-art baselines.
New method controls posterior collapse in VAEs without network architecture constraints.
problem Posterior collapse in VAEs reduces diversity of generated samples.
method Introduces Latent Reconstruction (LR) loss to control posterior collapse.
result Controls posterior collapse on various datasets without architectural constraints.
Time-resolved angiography with interleaved stochastic trajectories (TWIST) has been widely used for dynamic contrast enhanced MRI (DCE-MRI). To achieve highly accelerated acquisitions, TWIST combines the periphery of the k-space data from several adjacent frames to reconstruct one temporal frame. However, this view-sha…
New autoencoder learns structured representations without regularization.
problem Learning structured representations without relying on regularization.
method Proposes a novel autoencoder architecture that learns a hierarchy of latent variables.
result Improves results in generation, disentanglement, and extrapolation tasks.
New insights into optimizing latent representations in hierarchical VAEs.
problem Optimizing latent representations in hierarchical VAEs for various applications.
method Identifying a general class of inference models and deriving theoretical bounds on performance.
result Guidance for practitioners on optimal regions in rate-space for different applications.
A new hybrid VAE-GAN framework improves mode coverage and quality.
problem Mode collapse and poor sample quality in GANs and VAEs.
method Integrates a 'Best-of-Many-Samples' reconstruction cost and a stable synthetic likelihood estimate.
result Significant improvement in mode coverage and quality compared to hybrid VAE-GANs and plain GANs.
A decoder helps interpret neural network layers.
problem Understanding the output of neural network layers.
method Developed a Classifier-Decoder (ClaDec) architecture.
result Reconstructed images from ClaDec are more relevant for classification.
We present new intuitions and theoretical assessments of the emergence of disentangled representation in variational autoencoders. Taking a rate-distortion theory perspective, we show the circumstances under which representations aligned with the underlying generative factors of variation of data emerge when optimising…
A new method avoids overfitting in network reconstruction by using the minimum description length principle.
problem Determining the optimal model complexity in network reconstruction to prevent overfitting.
method Hierarchical Bayesian inference and weight quantization based on the minimum description length principle.
result The method yields increased accuracy in reconstructing both artificial and empirical networks.
Mercat preserves angles to create accurate low-dimensional embeddings.
problem Reconstructing global relationships in low-dimensional embeddings.
method Reconstructing angles between data points to preserve both local and global structures.
result Mercat yields good reconstruction across various experiments and metrics.
Grad-TTS models speech from text using diffusion probabilistic techniques.
problem Creating high-quality speech from text input.
method Score-based decoder with stochastic differential equations for noise-to-speech transformation.
result Grad-TTS produces mel-spectrograms from text input with competitive quality.
This paper describes a method for learning low-dimensional approximations of nonlinear dynamical systems, based on neural-network approximations of the underlying Koopman operator. Extended Dynamic Mode Decomposition (EDMD) provides a useful data-driven approximation of the Koopman operator for analyzing dynamical syst…
Kernel methods are powerful learning methodologies that allow to perform non-linear data analysis. Despite their popularity, they suffer from poor scalability in big data scenarios. Various approximation methods, including random feature approximation, have been proposed to alleviate the problem. However, the statistic…
New method learns from noisy data without knowing noise level.
problem Learning from noisy data without knowing noise level.
method Uses Stein's Unbiased Risk Estimate (SURE) without noise level knowledge.
result Outperforms other self-supervised methods on imaging problems.
In information theory, Fisher information and Shannon information (entropy) are respectively used to quantify the uncertainty associated with the distribution modeling and the uncertainty in specifying the outcome of given variables. These two quantities are complementary and are jointly applied to information behavior…
Improved autoencoders guide latent sentence representations for better text generation and manipulation.
problem Current autoencoders struggle to maintain coherent latent spaces for meaningful text manipulations.
method Adversarial autoencoders with a denoising objective (DAAE) to guide latent space geometry.
result DAAE provides the best trade-off between generation quality and reconstruction capacity.
New insights explain why β-VAEs fail at disentanglement.
problem Disentanglement performance of β-VAEs peaks at intermediate β and collapses as regularization increases. method Formalized information-theoretic mechanism, introduced λβ-VAE to stabilize disentanglement. result Strong regularization pressure leads to mutual information collapse in β-VAEs. A new approach to disentangled representations using structured latent priors.
problem Learning disentangled representations in unsupervised learning.
method Proposed a structured latent prior to encourage disentanglement and mitigate trade-offs.
result The structured latent prior significantly mitigates the trade-off between reconstruction loss and disentanglement.
Enhanced X-ray polarimetry with deep learning for better exposure times.
problem Improving sensitivity of X-ray telescopic observations with imaging polarimeters.
method A weighted maximum likelihood combination of predictions from a deep ensemble of ResNet convolutional neural networks trained on Monte Carlo event simulations.
result Improves effective exposure times by ~45% for power-law source spectra.
New binary AA methods improve on existing techniques.
problem Binary data limitations in AA methods.
method Proposed two optimization frameworks for binary AA.
result Superior performance on synthetic and real binary data.
A method improves Cryo-EM 3D map refinement by regularizing rotation estimation.
problem Noise-robustness vs. data-consistency in Cryo-EM 3D map reconstruction.
method Ellipsoidal support lifting (ESL) for regularizing and approximating the global minimizer over Riemannian manifolds.
result The induced bias due to regularizing effect of ESL estimates better rotations than global optimisation.
We consider the problem of reconstructing a rank-k n×n matrix M from a sampling of its entries. Under a certain incoherence assumption on M and for the case when both the rank and the condition number of M are bounded, it was shown in \cite{CandesRecht2009, CandesTao2010, keshavan2010, Recht2011, Jain2…
Improved neural image compression with refined latent representations.
problem Sub-optimal results from variational autoencoders due to imperfect optimization and capacity limitations.
method Stochastic Gumbel Annealing (SGA) and its extensions (SGA+), including three different methods.
result Significant improvement in compression performance, especially on the R-D trade-off.
Magnetic resonance image (MRI) reconstruction is a severely ill-posed linear inverse task demanding time and resource intensive computations that can substantially trade off {\it accuracy} for {\it speed} in real-time imaging. In addition, state-of-the-art compressed sensing (CS) analytics are not cognizant of the imag…