Spatially constrained Gaussian mixture models reduce covariance complexity.
problem High dimensionality in finite mixture models for spatial data.
method Spatial covariance constraint with only four free parameters.
result Improves clustering of multi-way spatial data and inference of spatial patterns.
Spatially constrained clustering divides landscapes into homogeneous regions with spatial contiguity.
problem Dividing landscapes into homogeneous patches with spatial contiguity and hierarchy.
method Developed a spatially constrained spectral clustering framework using a flexible kernel and recursive bisection.
result The proposed framework outperforms baseline methods in balancing region contiguity and homogeneity.
New strategy uses interpretability to improve adversarial learning.
problem Improving adversarial learning speed and effectiveness.
method Spatially constrained one-pixel adversarial perturbations guided by gradient-based interpretability.
result Spatially constrained one-pixel adversarial perturbations noticeably improve convergence and attack success.
New method predicts spatial events like hurricanes and earthquakes with uncertainty.
problem Quantifying uncertainty in natural hazard predictions.
method Representing spatial point clouds as empirical measures, constraining prediction sets to spatial data manifold, using Wasserstein distance.
result Achieves near-nominal coverage and lower energy/manifold distances compared to baselines.
Deep networks reveal colour opponent cells under retinal constraints.
problem Understanding colour vision in deep neural networks.
method Classifying cells in early layers of anatomically constrained convolutional neural networks.
result Emergence of single and double opponent cells in deep networks.
An unsupervised learning algorithm to cluster hyperspectral image (HSI) data is proposed that exploits spatially-regularized random walks. Markov diffusions are defined on the space of HSI spectra with transitions constrained to near spatial neighbors. The explicit incorporation of spatial regularity into the diffusion…
Scalable method for regionalizing and extracting temporal patterns from time series data.
problem Static spatial snapshots and ad hoc regularization limit effective spatial analysis and resource management.
method Minimum description length principle for fully nonparametric spatial partitioning and time series archetypes.
result Accurately recovers planted regional structure and drivers in synthetic and empirical data.
Asynchronous federated modeling improves spatial data sharing without centralizing raw data.
problem Privacy and bandwidth constraints in distributed spatial data.
method Asynchronous federated modeling using low-rank Gaussian process approximations with block-wise optimization and adaptive strategies.
result Asynchronous federated modeling achieves synchronous performance and outperforms it in heterogeneous settings.
Paper proposes dp-VAE for preserving spatial context in gene expression data.
problem Inaccessibility of spatial context in single-cell gene expression data.
method Generic representation learning and transfer learning framework with a distance-preserving regularizer.
result dp-VAE effectively reconstructs and imputes spatial context from gene expression data.
Deep models predict spatial phenomena with better accuracy.
problem Nonstationary and anisotropic spatial data modeling.
method Deep compositional spatial models using deep learning and approximate Bayesian inference.
result Deep compositional models provide better predictions and uncertainty quantification.
Hybrid model integrates GATv2 and geostatistics for better spatial prediction and uncertainty.
problem Accurate spatial prediction and uncertainty quantification in epidemiology and risk analysis.
method Integrates Graph Attention Network (GATv2) with model-based geostatistics (MBG) to capture relational and spatial dependencies.
result Hybrid model improves predictive accuracy and uncertainty quantification compared to standalone models.
To date, pavement management software products and studies on optimizing the prioritization of pavement maintenance and rehabilitation (M&R) have been mainly focused on three parameters; the pre-treatment pavement condition, the rehabilitation cost, and the available budget. Yet, the role of the candidate projects' spa…
Paper improves channel charting using autoencoders with spatial constraints.
problem Improving logical positioning of UEs using channel-state information.
method Representation-constrained autoencoders to enhance channel charts.
result Improved quality of learned channel charts for UE positioning.
Introduces a novel spatial attention module for convolutional networks.
problem Irregular boundaries in position-wise spatial attention maps hamper model generalization.
method Introduces a convolutional rectangular attention module with 5 parameters.
result Systematically outperforms position-wise counterparts in experiments.
Shielded LMC samples from non-convex spaces with repulsive drift.
problem Sampling from non-convex spaces with convex holes.
method Combining adaptive temperature and repulsive drift.
result Advantages over unconstrained sampling in constrained spaces.
Spatially relaxed inference tackles high-dimensional linear models with correlated covariates.
problem Accurate inference is challenging in high-dimensional settings with spatially correlated covariates.
method Proposes ensembled clustered inference algorithms that control the δ-FWER under standard assumptions. result Ensembled clustered inference algorithms control the δ-FWER and achieve decent power. OpFlow predicts robust OD flows by learning choice potentials conditioned on spatial exposures.
problem Deep models trained on raw counts are vulnerable to distribution shift.
method OpFlow learns row-centered choice potentials and reconstructs flows by combining them with a calibrated origin scale.
result OpFlow improves robustness under environment shifts, as shown by controlled synthetic shifts and a real-world experiment.
New method improves traffic forecasting models by adapting to spatial shifts.
problem Improving traffic forecasting models' ability to handle spatial shifts over years.
method Proposes a novel Mixture of Experts (MoE) framework for spatiotemporal models.
result Significant improvement in performance for handling spatial distribution shifts.
We propose a class of intrinsic Gaussian processes (in-GPs) for interpolation, regression and classification on manifolds with a primary focus on complex constrained domains or irregular shaped spaces arising as subsets or submanifolds of R, R2, R3 and beyond. For example, in-GPs can accommodate spatial domains arising…
In-BO optimizes complex constrained domains using SIn-GP surrogate models.
problem Optimizing in complex constrained domains with irregular shapes.
method Sparse Intrinsic Gaussian Processes (SIn-GP) on manifolds with heat kernel estimation.
result In-BO outperforms traditional BO in complex constrained domains.
A new method uses GANs for robust optimization under uncertain data.
problem Optimizing supply chains under demand uncertainty with ambiguous distributions.
method Generative adversarial networks (GANs) for data-driven distributionally robust chance constrained programming.
result The approach effectively handles uncertain data distributions and improves supply chain optimization.
New model predicts urban sprawl sensitivity from remote sensing data.
problem Forecasting urban sprawl sensitivity to economic factors.
method Physics-constrained conditional GANs for image-to-image translation.
result Model accurately predicts urban sprawl sensitivity without detailed data.
A new model for point processes without intensity function trade-offs.
problem Inefficiency and trade-offs in existing point process models.
method Point Set Diffusion, a diffusion-based latent variable model.
result Achieves state-of-the-art performance in point process generation.
Program synthesis struggles with complex spatial relationships in image classification.
problem Challenges in solving Synthetic Visual Reasoning Test problems.
method Quantitative reanalysis of human and machine performance, improved program synthesis classifier, categorization of SVRT problems.
result Program synthesis is constrained by spatial relationships in images, not just shape specification.
This work proposes a novel autoencoder for fusing visible and infrared images.
problem Challenging task to combine spatial and spectral information from visible and infrared images.
method Spatially constrained adversarial autoencoder with residual architecture and adversarial regularizer.
result Generates a more realistic fused image with enhanced spatial and spectral information.
This paper proposes a new method to compress CNNs for medical image analysis, improving efficiency and accuracy.
problem Large memory and computational requirements of CNNs in resource-constrained environments.
method Hierarchical spatio-channel low-rank compression framework that partitions feature maps into spatial regions and groups channels according to co-activation patterns within each region.
result The proposed method achieves significant FLOP reduction, inference speed-up, and improved classification accuracy compared to existing methods.
The paper improves GP regression for sparse sensor data in structural mode shape reconstruction.
problem Reconstructing full-field structural mode shapes from sparse sensor data.
method Physics-Constrained Single-Output Gaussian Process (CONS-SOGP) framework.
result The proposed method provides more accurate and reliable mode shapes.
Gaussian processes have been successful in both supervised and unsupervised machine learning tasks, but their computational complexity has constrained practical applications. We introduce a new approximation for large-scale Gaussian processes, the Gaussian Process Random Field (GPRF), in which local GPs are coupled via…
A framework for navigating environments with spatially correlated obstacles and uncertain blockage status.
problem Navigation in environments with spatially correlated obstacles of uncertain blockage status.
method Modeling spatial correlation with Gaussian Random Field, developing Bayesian belief updates, proposing a two-stage learning framework with offline and online phases.
result Consistent performance gains over baselines in environments with adversarial interruptions or clustered natural hazards.
Flexible spatial models improve predictive performance over nonstationary alternatives.
problem Improving predictive performance in nonstationary spatial modeling.
method Introduces a modular parametric covariance function that extends nonstationary spatial models.
result The proposed covariance function outperforms nonparametric methods in predictive performance.
Structural RBM reduces parameters for image denoising and classification.
problem High parameter count in RBMs limits their applicability to large datasets.
method Introduces SRBM with constrained connections to reduce parameters.
result SRBM achieves better performance and faster training than vanilla RBM.
Discover equations from data using neural networks with constraints.
problem Discover equations from noisy data without theoretical derivation.
method Solve constrained optimization problem with penalty or trust-region barrier methods.
result Constrained method outperforms penalty method for higher noise levels or fewer collocation points.
A new method for solving complex inverse problems using deep learning.
problem Estimating complex spatially-varying parameters in high-dimensional Bayesian inverse problems.
method A variational inference method with a deep generative prior to approximate the posterior distribution.
result The method improves estimation accuracy and efficiency for solving high-dimensional inverse problems.
Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.
problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.
Multigrid modeling algorithms are a technique used to accelerate relaxation models running on a hierarchy of similar graphlike structures. We introduce and demonstrate a new method for training neural networks which uses multilevel methods. Using an objective function derived from a graph-distance metric, we perform or…
DSRGAN learns independent structure and rendering without tuple supervision.
problem Learning disentangled representation for natural image generation without tuple supervision.
method Introducing an auxiliary domain with a common underlying-structure space, and designing a parallel generative network with a common Progressive Rendering Architecture.
result DSRGAN significantly outperforms state-of-the-art methods in disentanglability.
Inverse inference, or "brain reading", is a recent paradigm for analyzing functional magnetic resonance imaging (fMRI) data, based on pattern recognition and statistical learning. By predicting some cognitive variables related to brain activation maps, this approach aims at decoding brain activity. Inverse inference ta…
Latent FxLMS accelerates ANC by adapting along low-dimensional filter weights.
problem Improving active noise control with neural adaptive filters.
method Training an auto-encoder on filter coefficients, constraining weights to latent variables, and updating in latent space.
result Latent FxLMS converges in fewer steps with comparable error to standard FxLMS.
New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.
problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.
We develop three efficient approaches for generating visual explanations from 3D convolutional neural networks (3D-CNNs) for Alzheimer's disease classification. One approach conducts sensitivity analysis on hierarchical 3D image segmentation, and the other two visualize network activations on a spatial map. Visual chec…
M-CaStLe discovers causal structures in multivariate space-time data.
problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.
Spatial variable selection is crucial for reliable spatial predictions in machine learning.
problem Spatial autocorrelation leads to overfitting and poor spatial predictions.
method Used Random Forests with non-spatial and spatial cross-validation strategies.
result Spatial variable selection is essential for reliable spatial predictions.
Spatial blind source separation simplifies multivariate spatial prediction.
problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.
The paper introduces groupoid racks for spatial surfaces.
problem Coloring diagrams of spatial surfaces for invariant calculation.
method Introduces groupoid racks with universal properties.
result Groupoid racks provide an invariant for spatial surfaces.
STICC clusters geographic objects considering both spatial contiguity and attributes.
problem Discovering repeated geographic patterns with spatial contiguity.
method Spatial Toeplitz Inverse Covariance-Based Clustering (STICC) method.
result STICC significantly outperforms baseline methods in adjusted rand index and macro-F1 score.
We introduce a probabilistic generative model for disentangling spatio-temporal disease trajectories from series of high-dimensional brain images. The model is based on spatio-temporal matrix factorization, where inference on the sources is constrained by anatomically plausible statistical priors. To model realistic tr…
Spatial understanding is a fundamental problem with wide-reaching real-world applications. The representation of spatial knowledge is often modeled with spatial templates, i.e., regions of acceptability of two objects under an explicit spatial relationship (e.g., "on", "below", etc.). In contrast with prior work that r…
VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.
problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.