New inequality for refined knot invariants in a specific space.
problem General adjunction inequality for refined s-invariants does not hold. method Introduced an adjunction inequality for a specific spatial refinement in kCP2. result An adjunction inequality holds for the s-version of the Sq1-refinement in kCP2. We review the construction and context of a stable homotopy refinement of Khovanov homology.
Spatial refinement of Bar-Natan homology constructed.
problem Link invariants and their homotopy types.
method CW-spectrum construction and stable homotopy type.
result Stable homotopy type of constructed CW-spectrum is a link invariant.
We propose a probabilistic model for refining coarse-grained spatial data by utilizing auxiliary spatial data sets. Existing methods require that the spatial granularities of the auxiliary data sets are the same as the desired granularity of target data. The proposed model can effectively make use of auxiliary data set…
Computes Steenrod squares on Khovanov homology for knots up to 11 crossings.
problem Computing Steenrod squares on Khovanov homology.
method Spatial refinements of even and odd Khovanov homology, computation of Sq^2.
result Steenrod squares Sq^2 on Khovanov homology spaces are determined for knots up to 11 crossings.
Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.
problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.
A2-SBNN models spatial data with copulas for non-Gaussian dependencies.
problem Capturing complex spatial relationships and extreme dependencies in non-Gaussian data.
method Embedding A2 copula into a Bayesian neural network, trained with Wasserstein loss and moment matching.
result A2-SBNN consistently delivers high accuracy across various dependency strengths.
In 1983, Conway-Gordon showed that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum of the Arf invariants over all of the Hamiltonian knots is also congruen…
Spatial machine learning improves poverty targeting in Indonesia.
problem Conventional PMT methods have high exclusion and inclusion errors due to spatial dependencies and regional heterogeneity.
method Integrates spatial contiguity matrices into SML models to identify and compare poverty clusters.
result SML reduces exclusion errors from 28% to 20% compared to standard machine learning models.
Improved anti-cancer drug sensitivity prediction using REFINED CNN ensemble learning.
problem Challenges in predicting anti-cancer drug sensitivity for individual cell lines.
method Using REFINED CNN, which represents high-dimensional vectors as compact 2D images with spatial correlations, and building ensembles of these models.
result Ensemble approaches significantly improve drug sensitivity prediction performance compared to single models.
We introduce a multiscale supervised dimension reduction method for SPatial Interaction Network (SPIN) data, which consist of a collection of spatially coordinated interactions. This type of predictor arises when the sampling unit of data is composed of a collection of primitive variables, each of them being essentiall…
Convolutional-deconvolution networks can be adopted to perform end-to-end saliency detection. But, they do not work well with objects of multiple scales. To overcome such a limitation, in this work, we propose a recurrent attentional convolutional-deconvolution network (RACDNN). Using spatial transformer and recurrent …
MCFNet recovers spatial detail and fuses it with semantic information for real-time segmentation.
problem Recovering spatial detail information and fusing it with semantic information in real-time.
method Proposes a new architecture (MCFNet) with feature refinement and fusion modules, and a gating unit.
result Achieves competitive performance with high speed (75.5% mIOU, 151.3 FPS on Cityscapes).
STARK improves denoising of low-depth spatial transcriptomics images.
problem Denoising spatial transcriptomics images at ultra-low sequencing depths.
method Adaptive regularization with kernel ridge regression and graph Laplacian.
result STARK optimizes denoising performance over competing methods.
In hyperspectral image (HSI) classification, spatial context has demonstrated its significance in achieving promising performance. However, conventional spatial context-based methods simply assume that spatially neighboring pixels should correspond to the same land-cover class, so they often fail to correctly discover …
Enhances POU-Nets with probabilistic noise model for efficient spatial data clustering.
problem Improving the efficiency and accuracy of deep learning models for spatial data.
method Integrates Gaussian noise model into POU-Nets to enable gradient-based optimization and hierarchical refinement.
result Achieves sharp spatial partitions and higher-order polynomial approximation without regularizers.
We propose a probabilistic model for inferring the multivariate function from multiple areal data sets with various granularities. Here, the areal data are observed not at location points but at regions. Existing regression-based models can only utilize the sufficiently fine-grained auxiliary data sets on the same doma…
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.
Classifies defects in ordered media using homotopy theory.
problem Classifying defects in ordered media like liquid crystals.
method Using homotopy theory and continuous maps from ordered media to quotient spaces.
result Equivalence classes of defects are enumerated by subgroups of the quaternion group.
BrainCast predicts whole-brain fMRI time series from short scans.
problem Short scans reduce fMRI data quality and statistical power.
method Spatio-temporal forecasting framework for fMRI time series.
result BrainCast improves fMRI time series quality and prediction.
Bayesian deconditioning improves downscaling of spatial fields.
problem Challenges in refining low-resolution spatial fields with high-resolution information.
method Proposes a Bayesian formulation of deconditioning to solve the inverse problem of conditional expectation.
result Shows substantial improvements in atmospheric field downscaling over existing methods.
EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.
problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.
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…
Model infers functions for attributes using multi-aggregate datasets with knowledge transfer.
problem Modeling aggregate data with varying granularities and spatial supports.
method Multi-output Gaussian process (MoGP) with linear mixing of independent latent GPs, aggregation process, and prior distribution of mixing weights.
result Proposed model outperforms in refining coarse-grained aggregate data.
Parametric spatial transformation models have been successfully applied to image registration tasks. In such models, the transformation of interest is parameterized by a fixed set of basis functions as for example B-splines. Each basis function is located on a fixed regular grid position among the image domain, because…
CRAUM-Net improves salient object detection with context and uncertainty modeling.
problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.
Event ticket price prediction is important to marketing strategy for any sports team or musical ensemble. An accurate prediction model can help the marketing team to make promotion plan more effectively and efficiently. However, given all the historical transaction records, it is challenging to predict the sale price o…
Deep learning with Convolutional Neural Networks has shown great promise in various areas of image-based classification and enhancement but is often unsuitable for predictive modeling involving non-image based features or features without spatial correlations. We present a novel approach for representation of high dime…
Adaptive algorithm minimizes online prediction errors for irregular data.
problem Online adversarial regression with highly irregular prediction rules.
method Adaptive wavelet-based algorithm for Besov space regression.
result Minimax-optimal regret bounds in adversarial settings.
Road extraction from very high resolution satellite (VHR) images is one of the most important topics in the field of remote sensing. In this paper, we propose an efficient Non-Local LinkNet with non-local blocks that can grasp relations between global features. This enables each spatial feature point to refer to all ot…
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.
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.
Researchers prove a special case of Borde-Sorkin's conjecture about topology change in spacetimes.
problem Proving topology change in spacetimes with Morse functions is challenging.
method Using Morse functions to construct spacetimes and proving a special case of the Borde-Sorkin conjecture.
result Proved a special case of the Borde-Sorkin conjecture about causally continuous spacetimes.
Study adapts β-TCVAE for fMRI to recover nonlinear brain components.
problem Capturing nonlinear brain dynamics in fMRI data.
method Adapted β-TCVAE framework for fMRI data. result Recovery of meaningful nonlinear spatial components in fMRI data.
A new model for dynamic covariance recovery in neuroimaging data.
problem Estimating time-varying covariances in high-dimensional neuroimaging data.
method Nonconvex factorization into sparse spatial and smooth temporal components, combined with spectral initialization and gradient descent.
result The proposed method achieves linear convergence and superior performance compared to existing approaches.
We study refined topological string theory in the presence of orientifolds by counting second-quantized BPS states in M-theory. This leads us to propose a new integrality condition for both refined and unrefined topological strings when orientifolds are present. We define the SO(2N) refined Chern-Simons theory which co…
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…
Defines non-parabolic curves in spatial hybrid space with applications.
problem Defining and analyzing non-parabolic spatial hybrid framed curves.
method Definition and proof of existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
result Existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
New method tackles incomplete data in RBM inverse Ising problems.
problem Computing data and model expectations in inverse Ising problems with missing observations.
method Combines mean-field approximation, persistent contrastive divergence, and spatial Monte Carlo integration.
result Effective and accurate tuning of model parameters compared to conventional methods.
Refines neural network predictions using background knowledge for improved accuracy.
problem Compensate for lack of labeled data in neural networks.
method Introduces differentiable refinement functions and Iterative Local Refinement (ILR) algorithm to refine predictions efficiently and accurately.
result ILR finds competitive results in MNIST addition task and refines predictions on complex SAT formulas.
A framework converts spatial data into embeddings for insurance risk modelling.
problem Improving underwriting precision and risk management in insurance with spatial data.
method Multi-view contrastive learning framework for generating spatial embeddings.
result Spatial embeddings consistently improve predictive accuracy across various models.
This study analyses, through cross-section estimation methods, the influence of spatial effects in the conditional product convergence in the parishes' economies of mainland Portugal between 1991 and 2001 (the last year with data available for this spatial disaggregation level). To analyse the data, Moran's I statistic…
New research shows label refinement and weak training have limitations for aligning LLMs.
problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.
This paper reviews spatial and spatiotemporal volatility models.
problem Capturing spatial dependence in volatility of spatial and spatiotemporal data.
method Review of time series volatility models and their extensions.
result Comparison and practical recommendations for spatial and spatiotemporal volatility models.
The understanding of geographical reality is a process of data representation and pattern discovery. Former studies mainly adopted continuous-field models to represent spatial variables and to investigate the underlying spatial continuity/heterogeneity in the regular spatial domain. In this article, we introduce a more…
NCS enables efficient and accurate conditional simulation for complex spatial processes.
problem Challenges in simulating from complex spatial process distributions.
method Neural diffusion models and conditional score-based diffusion.
result NCS outperforms traditional methods in efficiency and accuracy.