New diagnostic method detects misspecified models in inverse PDE problems.
problem Misleading residual-norm diagnostics in inverse PDE problems.
method Structure-sensitive sequential diagnostic using e-processes.
result Rejects fitted models that produce biased predictions.
We show that Out(G) is residually finite if G is a one-ended group that is hyperbolic relative to virtually polycyclic subgroups. More generally, if G is one-ended and hyperbolic relative to proper residually finite subgroups, the group of outer automorphisms preserving the peripheral structure is residually finite. We…
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.
Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.
problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.
Study on residual Monge-Ampère mass of complex functions with directional Lipschitz continuity.
problem Estimating the residual Monge-Ampère mass of plurisubharmonic functions.
method General decomposition formula under Sasakian structure, L1-apriori estimate, upper-bound estimate on residual mass. result Upper-bound estimate on residual mass for uniformly directional Lipschitz continuity confirmed.
Extends VAEs to handle complex Bayesian network structures.
problem Handling complex dependency structures in Bayesian networks.
method Extends VAEs with graphical residual flows to model arbitrary dependency structures.
result Demonstrates improved performance on synthetic datasets.
RR-GNN improves GNN prediction intervals by accounting for graph heteroscedasticity and structural biases.
problem Uncertainty quantification in GNNs for high-stakes domains.
method Graph-Structured Mondrian CP, Residual-Adaptive Nonconformity Scores, Cross-Training Protocol.
result Improved efficiency and no loss of coverage compared to CP baselines.
RSPFs combine multiple SPNs for better density estimation.
problem Creating large SPNs for complex data.
method Random sum-product forests with residual links.
result RSPFs outperform individual SPNs and improve with residual links.
Proposes a neural network method to correct residual distortions in coordinate transformations.
problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.
Variational auto-encoders (VAEs) are a popular and powerful deep generative model. Previous works on VAEs have assumed a factorized likelihood model, whereby the output uncertainty of each pixel is assumed to be independent. This approximation is clearly limited as demonstrated by observing a residual image from a VAE …
Establishes functoriality of Baum-Bott residues under specific conditions.
problem Functoriality of Baum-Bott residues under certain conditions.
method Establishes functoriality of Baum-Bott residues under specific conditions.
result The singular set of a foliation has dimension at least \( k-1 \).
Theoretical limits of deep residual networks show consistent covariance structures.
problem Understanding the limits of deep residual networks.
method Analyzing the behavior of deep residual networks with skip connections as width and depth approach infinity.
result Theoretical analysis confirms that the covariance structure remains consistent regardless of the order of width and depth.
MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.
problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution
Graph neural networks suffer from oversmoothing, but adding residual connections helps.
problem Oversmoothing in deep graph neural networks where features become indistinguishable.
method Analyzed asymptotic oversmoothing rates with and without residual connections using the multiplicative ergodic theorem.
result Adding residual connections effectively mitigates or prevents oversmoothing.
The covariance matrix is formulated in the framework of a linear multivariate ARCH process with long memory, where the natural cross product structure of the covariance is generalized by adding two linear terms with their respective parameter. The residuals of the linear ARCH process are computed using historical data …
Gradient descent converges globally in deep linear residual networks with ZAS initialization.
problem Optimizing deep linear residual networks for convergence.
method Zero-asymmetric (ZAS) initialization for gradient descent.
result Gradient descent converges to an ε-optimal point in O(L^3 log(1/ε)) iterations.
Neural network residuals isolate and locate unknown faults.
problem Locating unknown faults in industrial systems.
method Neural network-based residuals combining physical insights and machine learning.
result Neural network residuals can isolate and locate unknown faults.
Computer vision model automates residual plot assessment for diagnosing model assumptions.
problem Automating residual plot assessment for model diagnostics.
method Trains a computer vision model to predict disparity between residual distributions and reference distributions using Kullback-Leibler divergence.
result Computer vision model is less sensitive to non-linearity but more sensitive than human judgment and conventional tests.
Develops a new multivariate regression model for complex outcomes.
problem Flexible, heterogeneous, and residual-dependent multivariate regression problems.
method MultiVCBART framework with Graphical Horseshoe priors.
result Empirically outperforms existing models on sparse, high-dimensional datasets.
RSIC identifies multiple ranks of interest in NMF by analyzing residual sensitivity.
problem Determining the optimal rank in NMF.
method RSIC analyzes sensitivity of relative residuals to different initializations.
result RSIC identifies meaningful ranks consistent with data structure.
ResNets can approximate arbitrary ODEs in space and time.
problem Approximating solutions of arbitrary ODEs in space and time.
method Using ResNets as space-time approximations of ODEs, deriving complexity estimates.
result Deep ReLU ResNets can approximate solutions of arbitrary ODEs in space and time.
Gradient descent efficiently finds global minima in deep neural networks.
problem Training deep neural networks efficiently and reliably.
method Gradient descent, leveraging the stability of the Gram matrix induced by the network architecture.
result Gradient descent achieves zero training loss in polynomial time for deep over-parameterized neural networks with residual connections.
Hybrid method improves SABR implied volatility approximation.
problem Improving SABR implied volatility approximation.
method Combining analytical structure with machine learning, using geometric features and residual correction.
result Hybrid model improves accuracy and robustness compared to analytical and neural-network approaches.
Deviance-style normalization for sparse, jointly overdispersed count matrices
problem Jointly overdispersed count matrices
method Dirichlet-multinomial deviance residualization
result Preserves exact sparsity, evaluates in constant time, recovers multinomial residual
Gen1S learns novel classes with 1-shot data using residual space and generative models.
problem Learning new classes with limited data in a growing dataset.
method Mapping embeddings to a residual space, using generative models to learn multi-modal distribution, and applying it as a structural prior.
result Consistent improvement over state-of-the-art methods in recognizing novel classes.
IRNet improves material property prediction from composition and crystal structure.
problem Predicting material properties from composition and crystal structure.
method Deep residual regression network with individual residual learning.
result IRNet outperforms state-of-the-art machine learning approaches in predicting material properties.
In this paper, we study the interplay between modules and sub-objects in holomorphic Poisson geometry. In particular, we define a new notion of "residue" for a Poisson module, analogous to the Poincaré residue of a meromorphic volume form. Of particular interest is the interaction between the residues of the canonical …
Novel LSTM network predicts pulsar timing residuals with few-shot data.
problem Predicting pulsar timing residuals with limited data.
method Long Short-Term Memory (LSTM) network optimized with model-agnostic meta-learning and particle swarm optimization.
result Robust generalization and accurate predictions across high-frequency test domains with minimal data.
DeRegiME forecasts with regime structure, improving probabilistic predictions across various time series.
problem Probabilistic forecasting discards residual uncertainty, and distribution shifts are hard to capture.
method DeRegiME uses a sparse variational Gaussian process with a nonstationary regime-mixing kernel to separate latent uncertainty regimes.
result DeRegiME improves NLPD by 20.3% on average across benchmarks, with gains on CRPS and MSE.
Study compact Willmore surfaces without complex structure convergence, computing energy loss and geodesic lengths.
problem Compactness of Willmore surfaces without complex structure convergence.
method Compute energy loss in neck and geodesic lengths in Grassmannian G(2,n). result Limit of Gauss map image is a geodesic in G(2,n) with computable length. Fast nonparametric conditional independence testing via two-stage regression
problem Fast nonparametric conditional independence testing
method BLITZ (Broad-to-Local Independence Testing via residualiZation)
result Better null calibration than fast kernel, random-feature, and regression-based competitors
New methods explain NE embeddings by identifying key variables.
problem Lack of interpretability in NE techniques.
method Combining PCA, Q-residuals, Hotelling's T2, and visualization.
result Identifies discriminatory features not seen in standard approaches.
Generalized ResNet learns unknown dynamical systems using neural networks.
problem Learning unknown dynamical systems with deep neural networks.
method A generalized ResNet framework using discrepancy as model correction.
result Generalized ResNet produces more accurate predictions than standard ResNet.
New method improves matrix completion accuracy, especially in noisy data.
problem Noisy matrix completion in recommendation systems and signal processing.
method Residual Spectral Matching criterion and pseudo-gradient algorithms.
result Improved numerical performance in noisy data environments.
Construct algorithms for Frobenius manifolds and residue pairings on Calabi-Yau varieties.
problem Construct algorithms for Frobenius manifolds and residue pairings on Calabi-Yau varieties.
method Analyze a dGBV algebra and introduce weak primitive forms.
result Explicit algorithms for Frobenius manifolds and residue pairings.
Residual Prior Diffusion integrates coarse latent priors with diffusion models for better generative tasks.
problem Diffusion models struggle with representing both large-scale and fine-scale details in data distributions.
method Two-stage framework: first a coarse prior model captures large-scale structure, then a diffusion model represents the residual.
result RPD accurately captures fine-scale details while preserving large-scale structure, outperforming standard diffusion models.
FactorGCL uses hypergraph learning to predict stock returns by mining hidden factors.
problem Mining effective factors in data-driven models is challenging due to low signal-to-noise ratio in market data.
method FactorGCL employs a hypergraph structure and temporal residual contrastive learning to extract hidden factors.
result FactorGCL outperforms existing methods and mines effective hidden factors for predicting stock returns.
In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …
New examples of hyperbolic 3-manifolds with unique profinite structure.
problem Finding hyperbolic 3-manifolds with unique profinite structure.
method Examining fundamental groups of closed fibered hyperbolic 3-manifolds.
result First examples of closed fibered hyperbolic 3-manifolds with unique profinite structure.
Link quandles are shown to be residually finite.
problem Residual finiteness of link quandles.
method Proving residual finiteness of free products of residually finite quandles with residually finite associated groups.
result Link quandles are residually finite.
KBB algorithm reduces sample complexity for policy evaluation in general state spaces.
problem Policy evaluation in large state spaces with high sample complexity.
method Alternates between fitting Bellman residual and estimating value function via adaptive feature set growth.
result Super-linear convergence rates demonstrated, with reductions in sample complexity.
A new deep learning model improves robustness and efficiency in predicting continuous variables.
problem Limited applicability of deep learning in domains with small sample sizes.
method Autoencoder-based residual deep network with shortcut connections.
result Achieves cutting-edge accuracy and efficiency in multiple datasets.
Abstract: Non-residually finite hyperbolic groups imply non-residually finite rigid hyperbolic groups.
problem Existence of non-residually finite hyperbolic groups
method Direct implication
result Existence of non-residually finite rigid hyperbolic groups
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.
Enhances machine learning interpretability using category theory.
problem Improving machine learning interpretability and social implementation.
method Develops a categorical framework for structured understanding of supervised learning.
result Introduces the Gauss-Markov Adjunction for clarifying residuals and parameters.
Review of neural network expressivity and architectures.
problem Understanding neural network expressivity across different architectures.
method Comprehensive overview of approximation results for various neural network types.
result Deep neural networks offer advantages over shallow ones for specific function classes.
STRIC detects anomalies in time series by analyzing residual signals.
problem Anomaly detection in multivariate time series data.
method End-to-end differentiable neural network architecture with Sequential Probability Ratio Test on residuals.
result STRIC outperforms state-of-the-art methods on multiple benchmarks.
In this note, residual finiteness of quandles is defined and investigated. It is proved that free quandles and knot quandles of tame knots are residually finite and Hopfian. Residual finiteness of quandles arising from residually finite groups (conjugation, core and Alexander quandles) is established. Further, residual…