Spatial smoothing improves BNNs' accuracy, uncertainty, and robustness without increasing computational cost.
problem Large ensembles in BNNs increase computational cost and reduce performance.
method Spatial smoothing adds blur layers to convolutional neural networks to ensemble neighboring feature map points.
result Spatial smoothing improves BNNs' performance with fewer ensembles and enhances robustness.
Defines concordance for spatial graphs and proves sliceness equivalence.
problem Understanding concordance and sliceness for spatial graphs.
method Smooth definitions and linking number conditions.
result Sliceness of a spatial graph is equivalent to a condition on linking numbers and a link.
New method provides valid confidence intervals for spatial associations.
problem Limited insight into covariate-response relationships in spatial settings.
method Lipschitz-driven uncertainty quantification for spatial association.
result Valid frequentist confidence intervals for associations in spatial settings.
This research optimizes Andrews plots for better visual clarity in high-dimensional data.
problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.
Proves some flat spacetimes can't be extended smoothly.
problem Proving smooth extension of certain FLRW spacetimes.
method Utilizing Sbierski's C0-inextendibility techniques. result Proves C0-inextendibility of spatially flat FLRW spacetimes. SpaCE tackles spatial confounding in scientific studies.
problem Spatial confounding influences treatment and outcome, leading to spurious associations.
method Introduces SpaCE toolkit for benchmark datasets and tools to evaluate causal inference methods.
result Facilitates automated evaluation of machine learning and causal inference models.
CutMix training technique improves spatial locality in Vision Transformers.
problem Improving spatial locality in Vision Transformers trained from scratch.
method Comparison of Baseline and Modern training protocols on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
result CutMix training component significantly reduces Mean Attention Distance (MAD) in early layers of Vision Transformers.
We consider open globally hyperbolic spacetimes N of dimension n+1, n≥3, which are spatially asymptotic to a Robertson-Walker spacetime or an open Friedmann universe with spatial curvature κ~=0,−1 and prove, under reasonable assumptions, that there exists a unique foliation by hypersurfaces of constant…
Post-estimation smoothing improves prediction accuracy with structural indices.
problem Using natural structural indices in machine learning without losing robustness.
method A post-estimation smoothing operator that separates from the original predictor.
result Post-estimation smoothing improves accuracy over original predictors under simple conditions.
Spatial Adapter adds structured spatial representation to frozen predictors.
problem Efficiently adding spatial structure to pre-trained models.
method Structured spatial decomposition and closed-form covariance for residual fields.
result Adapter improves spatial prediction and uncertainty quantification.
Paper presents a method for geographic ratemaking using spatial embeddings.
problem Lack of historical loss data in areas with high exposures.
method Construct spatial features within a complex representation model and use them as inputs to a predictive model.
result Predictions have smaller bias and variance than other spatial interpolation models.
A 3-stage method enhances hyperspectral image classification accuracy.
problem Classifying detailed classes in hyperspectral images with limited labeled data.
method Uses Nested Sliding Window and PCA for spatial consistency, SVM for spectral estimation, and TV model for spatial smoothing.
result Our method outperforms state-of-the-art algorithms, especially in scenarios with small training sets.
Forest-guided smoothing uses random forest outputs for interpretable local smoothers.
problem Creating interpretable local smoothers from complex random forest outputs.
method Uses random forest outputs to define spatially adaptive bandwidth matrices for a linear smoother.
result Improves interpretability and applicability of random forest outputs for various analyses.
Proposes a deep neural network approach for image response regression.
problem Associations between medical images and covariates.
method Spatially varying coefficient models with deep neural networks.
result Explicitly accounts for spatial smoothness and subject heterogeneity.
Deep learning method for semiparametric regression of spatial data.
problem Estimating relationships between response and covariates in spatially dependent data.
method A sparsely connected deep neural network with ReLU activation function.
result The method is consistent and can handle large datasets.
Smooth metrics satisfying Penrose inequality are necessarily smooth.
problem Rigidity of Penrose inequality with singular metrics.
method Showed suitable singular metrics attaining the optimal value in the Riemannian Penrose inequality are smooth in specified coordinates.
result Smooth metrics satisfying Penrose inequality are necessarily smooth.
In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…
Proposes a deep neural network for spatial data regression.
problem Regression of spatial data using deep neural networks.
method Localized two-layer deep neural network for spatial data, proving consistency and asymptotic convergence.
result Asymptotic convergence rate is faster than existing methods, demonstrating effectiveness on temperature estimation.
Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.
problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.
Hyperspectral remote sensing images (HSIs) usually have high spectral resolution and low spatial resolution. Conversely, multispectral images (MSIs) usually have low spectral and high spatial resolutions. The problem of inferring images which combine the high spectral and high spatial resolutions of HSIs and MSIs, resp…
Model place cells as spatial embeddings for efficient path planning and cognitive map construction.
problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.
Predictive models can be used on high-dimensional brain images for diagnosis of a clinical condition. Spatial regularization through structured sparsity offers new perspectives in this context and reduces the risk of overfitting the model while providing interpretable neuroimaging signatures by forcing the solution to …
Recent studies show that widely used deep neural networks (DNNs) are vulnerable to carefully crafted adversarial examples. Many advanced algorithms have been proposed to generate adversarial examples by leveraging the Lp distance for penalizing perturbations. Researchers have explored different defense met…
Deep nets with massive data learn spatially sparse functions.
problem Understanding the importance of massive data in deep learning.
method Established a sampling theorem and proved optimal learning rates.
result Massive data is crucial for deep nets to learn spatially sparse functions.
Deep learning has shown high performances in various types of tasks from visual recognition to natural language processing, which indicates superior flexibility and adaptivity of deep learning. To understand this phenomenon theoretically, we develop a new approximation and estimation error analysis of deep learning wit…
Latent variable models have been widely applied for the analysis of time series resulting from experimental neuroscience techniques. In these datasets, observations are relatively smooth and possibly nonlinear. We present Variational Inference for Nonlinear Dynamics (VIND), a variational inference framework that is abl…
Efficient spatio-temporal Gaussian process inference method.
problem Scalable Gaussian process inference for multivariate, spatio-temporal data.
method Combines spatio-temporal filtering with natural gradient variational inference, resulting in a scalable non-conjugate GP method.
result Linear scaling with respect to time and logarithmic scaling with respect to time steps.
New cosmological spacetimes without CMC Cauchy surfaces found.
problem Finding CMC Cauchy surfaces in cosmological spacetimes.
method Generalized Bartnik's construction to connected sums of three-manifolds.
result Cosmological spacetimes without CMC Cauchy surfaces for any compact three-manifolds.
Kulldorff's (1997) seminal paper on spatial scan statistics (SSS) has led to many methods considering different regions of interest, different statistical models, and different approximations while also having numerous applications in epidemiology, environmental monitoring, and homeland security. SSS provides a way to …
Develops statistical methods for rates of change on Riemannian manifolds.
problem Statistical inference for rates of change in spatial processes over non-Euclidean domains.
method Formalizes smoothness and constructs differential processes for Riemannian manifolds, derives conditions for kernel existence, and develops predictive inference.
result Validates theoretical findings through simulation experiments for derivatives over polyhedral meshes.
The evolute of a smooth curve in an m-dimensional Euclidean space is the locus of centers of its osculating spheres, and the evolute of a spatial polygon is the polygon whose consecutive vertices are the centers of the spheres through the consecutive (m+1)-tuples of vertices of the original polygon. We study the iterat…
Comparing data defined over space and time is notoriously hard, because it involves quantifying both spatial and temporal variability, while at the same time taking into account the chronological structure of data. Dynamic Time Warping (DTW) computes an optimal alignment between time series in agreement with the chrono…
Hyperspectral remote sensing images (HSIs) are characterized by having a low spatial resolution and a high spectral resolution, whereas multispectral images (MSIs) are characterized by low spectral and high spatial resolutions. These complementary characteristics have stimulated active research in the inference of imag…
The paper studies singularities in discrete indefinite affine minimal surfaces.
problem Characterizing singularities in discrete indefinite affine minimal surfaces.
method Discretizing smooth curves and applying discrete Lelieuvre's formulas to study the resulting surfaces.
result The definition of singular edges and vertices in discrete asymptotic nets mirrors properties of smooth surfaces.
Functional Magnetic Resonance Imaging (fMRI) relies on multi-step data processing pipelines to accurately determine brain activity; among them, the crucial step of spatial smoothing. These pipelines are commonly suboptimal, given the local optimisation strategy they use, treating each step in isolation. With the advent…
Suppose one is faced with the challenge of tissue segmentation in MR images, without annotators at their center to provide labeled training data. One option is to go to another medical center for a trained classifier. Sadly, tissue classifiers do not generalize well across centers due to voxel intensity shifts caused b…
In this paper, we investigate the moduli of continuity for viscosity solutions of a wide class of nonsingular quasilinear evolution equations and also for the level set mean curvature flow, which is an example of singular degenerate equations. We prove that the modulus of continuity is a viscosity subsolution of some o…
The wavelet Maximum Entropy on the Mean (wMEM) approach to the MEG inverse problem is revisited and extended to infer brain activity from full space-time data. The resulting dimensionality increase is tackled using a collection of techniques , that includes time and space dimension reduction (using respectively wavelet…
SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.
problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.
Deep learning has exhibited superior performance for various tasks, especially for high-dimensional datasets, such as images. To understand this property, we investigate the approximation and estimation ability of deep learning on anisotropic Besov spaces. The anisotropic Besov space is characterized by direction-depen…
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
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.
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 improves curvature estimates for Ricci flow solutions with bounded scalar curvature.
problem Proving curvature estimates for Ricci flow solutions with bounded scalar curvature.
method Localised weighted curvature integral estimates for solutions to Ricci flow.
result Integral curvature estimates imply a uniform bound on the spatial L2 norm of the Riemannian curvature tensor. New equations reveal how cylinder power in progressive lenses depends on geodesic curvature.
problem Current understanding of cylinder power in progressive lenses is incomplete.
method Derived complete compatibility equations for spatially-varying curvature surfaces.
result Cylinder power depends on geodesic curvature, not just principal curvature.
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.
Machine learning algorithms find frequent application in spatial prediction of biotic and abiotic environmental variables. However, the characteristics of spatial data, especially spatial autocorrelation, are widely ignored. We hypothesize that this is problematic and results in models that can reproduce training data …
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.