BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.
problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.
Paper improves MRI reconstruction by separating target labels and prediction error.
problem Improving MRI reconstruction accuracy by estimating prediction error.
method Proposes a novel method to estimate target labels and prediction error separately.
result Significantly better MRI reconstruction results achieved compared to state-of-the-art methods.
Dr.VAE improves drug response prediction accuracy.
problem Improving accuracy of drug response prediction.
method Two deep generative models based on Variational Autoencoders.
result Dr.VAE outperforms benchmarks by 3-11% AUROC and 2-30% AUPR.
New algorithms predict spatio-temporal data without assuming its structure.
problem Predicting high-dimensional spatio-temporal data without assuming its structure.
method Light cone decompositions and three simple algorithms for predictive state reconstruction.
result Good predictive performance and distributions over spatio-temporal data.
Convolutional neural networks make astronomical image reconstruction faster and more efficient.
problem Efficiently reconstructing astronomical images from noisy or incomplete data.
method Use of convolutional neural networks for image reconstruction.
result Neural networks enable a linear complexity prediction step, making reconstruction computationally efficient.
We solve 6-DoF localisation and 3D reconstruction using deep state-space models.
problem 6-DoF localisation and dense 3D reconstruction in spatial environments.
method Approximate Bayesian inference in a deep state-space model combining learning and domain knowledge.
result Near state-of-the-art performance on UAV flight data.
This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. The utility function encodes some a priori knowledge ex…
Graph autoencoders improve node embeddings using random walk regularization.
problem Graph autoencoders' reconstruction loss ignores latent representation distribution.
method Random walk regularization to improve latent representations.
result The method achieves state-of-the-art accuracy on link prediction tasks.
STAR-GCN improves recommender systems by learning node representations.
problem Cold start problem in recommender systems.
method Stacked and reconstructed Graph Convolutional Networks (GCN) with intermediate supervision and node embedding reconstruction.
result Significant improvements in predicting ratings, especially in the cold start scenario.
New algorithm improves signal reconstruction from noisy measurements with side information.
problem Reconstructing unknown signals from noisy linear measurements with side information.
method Integrates side information into approximate message passing (AMP) and tracks performance using state evolution.
result AMP-SI performance is accurately predicted by state evolution.
Unified theory explains and mitigates double descent in data reconstruction.
problem Understanding and mitigating double descent in reduced order modeling.
method Data-Noise Averaging theory, sufficient criteria, detailed risk curve prediction, regularization mechanisms.
result Detailed risk curves predicted at reduced computational cost, instability traced to individual sensors.
New method uses Cantor embeddings and Wasserstein distances to analyze predictive states in time series data.
problem Analyzing predictive states in stochastic processes using time series data.
method Wasserstein distances for detecting predictive equivalences in symbolic data, using Cantor embeddings for finite-dimensional representation.
result Exploratory analysis of temporal structure in various processes reveals insights.
Stacked Capsule Autoencoders reconstruct objects from images using part relationships.
problem Reconstructing objects from images with robustness to viewpoint changes.
method Two-stage unsupervised capsule autoencoder that predicts part templates and object capsules.
result State-of-the-art results for unsupervised classification on SVHN and MNIST.
Deep learning method restores missing system events.
problem Restoring missing data in imperfect system traces.
method Long Short-Term Memory Networks (LSTMs) for sequence prediction.
result LSTM model can predict future events with 90% accuracy and reconstruct long sequences.
A new method learns label correlations for better multi-label predictions.
problem Label correlations not accurately characterized by existing approaches.
method Sparse reconstruction in the label space to learn correlations, then integrate into model training.
result Our approach outperforms state-of-the-art multi-label learning methods.
New algorithm extracts device profiles for short-term power predictions in commercial buildings.
problem Short-term power prediction in commercial buildings with high accuracy.
method Unsupervised extraction of device profiles from aggregate power measurements, disaggregation using particle swarm optimization, and state changes forecast by artificial neural networks.
result Developed approach outperforms existing methods with high accuracy.
ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.
problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.
Algorithm reconstructs spreading model parameters from incomplete data.
problem Reconstructing unknown transmission probabilities from partial observation data.
method Dynamic message-passing algorithm for incomplete spreading data.
result Efficient algorithm reconstructs parameters of spreading models.
Trans-Unet predicts brain folding patterns from 3D point-clouds using novel 3D-to-2D transformation.
problem Challenges in learning high-fidelity 3D point-cloud features, including permutation invariance and fine-grained surface reconstruction.
method Transform 3D point-clouds into a 2D grid domain, then use a U-shaped hybrid model with CNNs and self-attention mechanisms.
result Trans-Unet achieves high-resolution predictions of brain patch growth, surpassing existing methods in fidelity and accuracy.
DefogGAN predicts hidden RTS game information to aid strategic decision-making.
problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.
We introduce 'mixed LICORS', an algorithm for learning nonlinear, high-dimensional dynamics from spatio-temporal data, suitable for both prediction and simulation. Mixed LICORS extends the recent LICORS algorithm (Goerg and Shalizi, 2012) from hard clustering of predictive distributions to a non-parametric, EM-like sof…
Paper studies non-tight reconstruction threshold in a 4-state model with different in/out block mutations.
problem Non-tight reconstruction threshold in a 4-state symmetric model with different in-block and out-block mutations.
method Inspired by the q1+q2 stochastic block model, rigorously analyzes conditions for non-tightness of the reconstruction threshold. result Rigorously gives conditions for the non-tightness of the reconstruction threshold in a 4-state symmetric model.
Robot predicts future frames for navigating dynamic environments using LSTM autoencoder.
problem Predicting movement of objects in dynamic environments with moving obstacles.
method Multi-layer LSTM autoencoder network that reconstructs future frames conditioned on the agent's action.
result The proposed network generates future frames that can be used by reinforcement learning for navigation.
Model predicts traffic flow dynamics from sparse data.
problem Predict traffic flow from limited data.
method Mesoscopic model using factor graphs and message passing.
result Efficiently estimates traffic conditions with low probe vehicle penetration.
MKPN predicts varying-sized kernels for burst image denoising.
problem Denoising burst images corrupted by noise.
method Deep neural network (MKPN) predicts and fuses kernels of varying sizes.
result MKPN outperforms state-of-the-art on synthetic datasets.
A VAE model predicts material properties and microstructures.
problem Building forward and inverse structure-property linkages in materials science.
method Combines VAE with regression, using a two-level prior and multi-modal Gaussian mixture.
result The model achieves accurate forward and inverse predictions of material properties and microstructures.
Paper presents efficient algorithms for reconstructing noisy pooled data.
problem Reconstructing hidden states from noisy pooled data.
method Simple and efficient distributed algorithms for two noise models.
result Our algorithms reconstruct exact initial states with high probability.
ECLAIR improves lineage reconstruction from single-cell data with uncertainty estimates.
problem Uncertainty in cell lineage reconstruction from high-dimensional single-cell data.
method ECLAIR uses an ensemble approach to improve robustness and provide uncertainty estimates.
result ECLAIR successfully reconstructs known lineage relationships and improves robustness of predictions.
BCD-Net improves low-dose CT image reconstruction.
problem Challenges in obtaining accurate low-dose CT images.
method Modified iterative regression CNN, BCD-Net, with faster numerical solvers.
result BCD-Net achieves better image quality and generalization than state-of-the-art methods.
Deep learning solves jigsaw puzzles by classifying fragment positions.
problem Automated reconstruction of archaeological fragments from jigsaw puzzles.
method Classifies relative positions of fragments using deep neural networks and local feature co-occurrences.
result Our method outperforms state-of-the-art by 25%.
Bayesian method predicts future network configurations from past snapshots.
problem Reconstructing evolving networks from partial observations.
method Bayesian approach using past network snapshots to inform future predictions.
result Method accurately predicts link probabilities and network structure.
DAC-SSM learns domain-agnostic states for better imitation learning.
problem Domain shifts hinder imitation learning in partially observable tasks.
method DAC-SSM uses adversarial training to remove domain-dependent information from states.
result DAC-SSM achieves comparable performance to experts in sparse reward tasks.
The paper develops a neural network for learning dynamics from data.
problem Trade-off between representational capacity and overfitting in EDMD.
method Linear recurrent autoencoder network for Koopman operator approximation.
result Improved model reduction and nonlinear reconstruction techniques.
New algorithm learns stable LDSs with lower error and better control performance.
problem Learning stable LDSs from data with minimal reconstruction error and stability constraints.
method Proposes an optimization method using a recent characterization of stable matrices, iteratively improving reconstruction error and ensuring stability.
result Achieves orders-of-magnitude improvement in reconstruction error compared to existing methods.
XPDNet wins MRI reconstruction challenge with neural network.
problem MRI reconstruction from under-sampled data.
method Inspired by MRI and computer vision best practices, XPDNet uses a neural network.
result XPDNet achieved state-of-the-art results in the 2020 fastMRI challenge.
New quantum state reconstruction method accelerates convergence.
problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.
Paper defines AI-specific loss reconstruction problem and introduces CER framework.
problem Reconstructing AI-generated losses, especially in agentic systems.
method CER framework: C (control boundary), E (evidence reconstruction), R (insurance response).
result Defines AI-specific reconstruction problem and operationalizes it.
Recurrent neural networks' hidden state can be reconstructed from its past, providing a theoretical framework for stability and tracking.
problem Hidden-state stability in RNNs
method Backward coherence analysis
result Almost-sure convergence, rates under mixing, interpretable limiting representation, finite pathwise stopping times, and theoretical framework for time-uniform confidence sequences.
Capsule models detect adversarial images by reconstructing from top-level capsules.
problem Detecting adversarial images that look like a typical member of the predicted class.
method Capsule models trained to reconstruct images from pose parameters and identity of the correct top-level capsule.
result Setting a threshold on reconstruction error effectively detects adversarial images.
New method improves model reconstruction using counterfactuals and polytope theory.
problem Reconstructing models with minimal input changes and avoiding decision boundary shifts.
method Using polytope theory to derive loss functions that treat counterfactuals differently from ordinary instances.
result Improves fidelity between target and surrogate model predictions on multiple datasets.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Deep learning enhances optical microscopy and image reconstruction.
problem Improving image data transformations in optical microscopy.
method Application of deep learning methods on optical microscopy and image reconstruction.
result Deep learning enables new transformations among different modes and modalities of microscopic imaging.
Predicts trainability of deep neural networks using reconstruction entropy.
problem Predicting the initial conditions for trainability of deep neural networks.
method Cascade of auxiliary networks to reconstruct input from activation layers, computing relative entropy.
result Predicts trainability of deep feedforward networks on various datasets with a single epoch.
DAPDAG learns DAG structure to adapt predictions across domains.
problem Predicting in a new domain without labeled data.
method Auto-encoder with DAG reconstruction as auxiliary task.
result Reconstructing DAG benefits approximate inference and prediction.
Graph auto-encoder predicts unobserved node features from biological networks and omics data.
problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.
DEER network improves few-view breast CT image reconstruction efficiency and quality.
problem Efficient and high-quality few-view breast CT image reconstruction.
method Deep Efficient End-to-end Reconstruction (DEER) network with low model complexity.
result DEER network achieves competitive image quality with significantly fewer parameters compared to state-of-the-art methods.
New approach predicts commuters' flow with 90.4% accuracy.
problem Limited ability to predict and reconstruct commuters' networks.
method Machine learning and 22 urban indicators.
result Predictions with 90.4% accuracy and 77.6% variance explained.
Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.
problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.