The paper analyzes how to combine self-protection and self-insurance for risk reduction.
problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.
We obtain a residue formula for an obstruction to the existence of coupled Kähler-Einstein metrics described by Futaki-Zhang. We apply it to an example studied separately by Futaki and Hultgren which is a toric Fano manifold with reductive automorphism, does not admit a Kähler-Einstein metric but still admits coupled K…
Many features of dimensional reduction schemes are determined by the breaking of higher dimensional general covariance associated with the selection of a particular subset of coordinates. By investigating residual covariance we introduce lower dimensional tensors --generalizing to one side Kaluza-Klein gauge fields and…
Jointly reduces echo, reverberation, and noise using neural networks.
problem Simultaneous reduction of acoustic echo, reverberation, and noise.
method Multichannel Gaussian modeling and neural network for joint optimization of filters.
result Outperforms individual and joint non-spectral models.
In this work we introduce a category of discrete Lagrange--Poincare systems LP_d and study some of its properties. In particular, we show that the discrete mechanical systems and the discrete mechanical systems obtained by the Lagrangian reduction of symmetric discrete mechanical systems are objects in LP_d. We introdu…
In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show …
We provide some insights in the study of branching problems of reductive groups, and a method of investigations into symmetry breaking operators. First, we give geometric criteria for finiteness property of linearly independent continuous (respectively, differential) operators that intertwine two induced representation…
This work extends reduction processes for nonholonomic discrete mechanical systems.
problem Nonholonomic discrete mechanical systems and their reductions.
method Introduces a category LDPd of discrete-time dynamical systems and a two-stage reduction process. result Two-stage reduction process produces systems isomorphic to one-stage reduction.
GT-DDP optimizer trains residual networks using game theory.
problem Applying DDP to residual networks.
method Game-theoretic DDP optimizer for residual networks.
result Improved training convergence and variance reduction.
Optimization geometrodynamics simplifies adaptive optimizer dynamics.
problem Hidden states in adaptive optimizers complicate gradient-based learning.
method Develops a variational theory to eliminate hidden states and compose across hierarchies.
result Yields interaction curvature that integrates to finite contrasts.
One of the ways to train deep neural networks effectively is to use residual connections. Residual connections can be classified as being either identity connections or bridge-connections with a reshaping convolution. Empirical observations on CIFAR-10 and CIFAR-100 datasets using a baseline Resnet model, with bridge-c…
CCP clusters correlated features and projects them to 1D for efficient dimensionality reduction.
problem Efficiency in handling large datasets with high intrinsic dimensions.
method CCP partitions features into correlated clusters and projects them to 1D based on sample correlations.
result CCP achieves efficient dimensionality reduction without matrix diagonalization.
Proves a Baum--Bott formula for foliations by curves with logarithmic terms.
problem Analyzing singularities and smoothness in foliations by curves.
method Logarithmic Baum--Bott residues for foliated triples (X,F,D), relating to Poincaré's Problem and GSV indices. result Logarithmic Baum--Bott residues generalize Aleksandrov logarithmic index for vector fields on hypersurfaces.
Efficient Winograd convolution for INT8 networks using RNS.
problem Difficulty in applying Winograd algorithm to low-precision quantized networks.
method Extends Winograd algorithm to Residue Number System (RNS) for efficient INT8 convolution.
result Arithmetic complexity reduction up to 7.03x with performance improvement up to 2.30x-4.69x.
Neural operators correct PDE residuals to improve BIP solutions.
problem Reducing error in infinite-dimensional Bayesian inverse problems with neural operators.
method Error correction using PDE residuals to improve neural operator approximation.
result Trained neural operators with error correction achieve a quadratic reduction in approximation error.
This paper investigates the hedging effectiveness of a dynamic moving window OLS hedging model, formed using wavelet decomposed time-series. The wavelet transform is applied to calculate the appropriate dynamic minimum-variance hedge ratio for various hedging horizons for a number of assets. The effectiveness of the dy…
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.
New method for evaluating and learning in complex decision-making scenarios.
problem Evaluating and learning from policies in contextual combinatorial bandits with high bias and variance.
method Factored action space decomposition and importance sampling-based estimator (OPCB).
result OPCB achieves superior performance in OPE and OPL compared to conventional methods.
We provide theoretical and empirical evidence for a type of asymmetry between causes and effects that is present when these are related via linear models contaminated with additive non-Gaussian noise. Assuming that the causes and the effects have the same distribution, we show that the distribution of the residuals of …
Improved stochastic approximation method reduces residual error.
problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T−1/2+o(1) residual reduction with O(1) primitive samples. A method to reduce bias in model-based policy evaluation by shifting operators.
problem Bias in value function computation from noisy estimated models.
method Operator shifting method to reduce the residual norm error.
result The shifting factor is always positive and upper bounded by $1+O\left(1/n
ight)$.
In dealing with high-dimensional data sets, factor models are often useful for dimension reduction. The estimation of factor models has been actively studied in various fields. In the first part of this paper, we present a new approach to estimate high-dimensional factor models, using the empirical spectral density of …
CPFM integrates dimensionality reduction and reconstruction with flow networks.
problem Learning coupled continuous flows for data and embeddings.
method Coupled flow matching framework with Gromov-Wasserstein objective and dual-conditional flow network.
result CPFM preserves and recovers residual information in latent space.
Study quadratic one-forms on logarithmic Higgs bundles on pointed curves.
problem Quadratic one-forms on logarithmic Higgs bundles on pointed curves.
method Use elementary pole cancellation for invariant polynomials.
result Found a logarithmic quadratic one-form.
AGCA approximates angular variation on the unit sphere, reducing extremal dependence problems to eigenanalysis.
problem Approximating angular variation in multivariate extremes.
method Anchored geodesic component analysis (AGCA) approximates angular variation by great subspheres constrained to pass through a chosen reference direction.
result AGCA finds concentrated tail directions in daily equity-portfolio losses, explaining about 91% of anchored variation.
A new algorithm for time series prediction intervals.
problem Non-exchangeability in time series data.
method Adaptive re-estimation of non-conformity scores.
result Significant reduction in interval width compared to existing methods.
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
Paper uses optimal transport for low-dimensional representation of leukemia flow cytometry data.
problem Detecting minimal residual disease in leukemia patients using flow cytometry data.
method Optimal transport for dimensionality reduction and visualization of multi-patient flow cytometry datasets.
result OT-based approach provides a more informative two-dimensional representation of leukemia MRD.
New GP kernel handles mixed-categorical data, improving model accuracy.
problem Improving Gaussian process models for mixed-categorical data.
method Extends continuous exponential kernels to handle mixed-categorical variables.
result The proposed GP model gives higher likelihood and smaller residual error.
We consider dimensional reduction of gauge theories with arbitrary gauge group in a formalism based on equivariant principal bundles. For the classical gauge groups we clarify the relations between equivariant principal bundles and quiver bundles, and show that the reduced quiver gauge theories are all generically buil…
Improved nonparametric regression with debiasing for root-n consistency.
problem Challenges in achieving root-n consistency and normal distribution for nonparametric estimators.
method Debiasing technique by adding a correction term to nonparametric estimators.
result Achieves root-n consistency and asymptotic normality.
Unified convergence analysis of alpha-SVRG under strong convexity.
problem Analyzing the convergence of alpha-SVRG in strongly convex environments.
method Unified convergence rate expression for alpha-SVRG under fixed learning rate, demonstrating faster convergence than SGD and SVRG.
result alpha-SVRG has a faster convergence rate compared to SGD and SVRG under suitable choice of alpha.
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
Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free quandles and knot quandles are residually finite. In this paper, we extend these resul…
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…
SX-GeoTree improves spatially coherent explanations in geospatial regression trees.
problem Capturing spatial dependence and producing robust explanations in tabular prediction models.
method Integrates three objectives: impurity reduction, spatial residual control, and explanation robustness via modularity maximization on a consensus similarity network.
result Improves residual spatial evenness and doubles attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05).
Every non-trivial knot group is fully residually perfect.
problem Understanding the residual properties of knot groups.
method Analyzing the residual properties of knot groups using group theory.
result Every non-trivial knot group is fully residually perfect.
CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.
problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.
Residual flows are shown to approximate MMD well.
problem Lack of theoretical understanding of normalizing flows' expressiveness.
method Proved residual flows are universal approximators in MMD.
result Residual flows can approximate MMD with a bounded number of blocks.
Let p be a prime. In this paper, we classify the geometric 3-manifolds whose fundamental groups are virtually residually p. Let M=M3 be a virtually fibered 3-manifold. It is well-known that G=π1(M) is residually solvable and even residually finite solvable. We prove that G is always virtually residually p…
Researchers identify critical protein residues using advanced graph theory.
problem Identifying essential residues in proteins for function.
method Learning Random Geometric Graphs (RGG) with Cramer's V correlation and organic thresholding.
result Advanced RGG methods accurately identify critical residues compared to existing techniques.
Develops EFT for ResNets, revealing limitations of kernel-only approach.
problem Limitations of kernel-only approach in deep neural networks.
method Collective kernel EFT for pre-activation ResNets based on G-only closure hierarchy. result Numerical findings show V4 equation residual accumulates to an O(1) error. GenInSAR uses CNNs to filter InSAR phase and estimate coherence without supervision.
problem Improving accuracy in InSAR phase filtering and coherence estimation.
method Unsupervised CNN-based generative model for joint phase filtering and coherence estimation.
result GenInSAR outperforms five related methods in residue reduction and coherence estimation.
Defines Wodzicki residue using groupoids and fibered distributions.
problem Defining and understanding the Wodzicki residue in noncommutative geometry.
method Using groupoid language and filtered manifolds, defining the residue and showing its properties.
result The groupoidal residue is a trace on pseudodifferential operators and matches the usual residue in certain cases.
In this work we prove a Baum-Bott type residue theorem for flags of holomorphic foliations. We prove some relations between the residues of the flag and the residues of their correspondent foliations. We define the Nash residue for flags and we give a partial answer to the Baum-Bott type rationality conjecture in this …
We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in the DeepMind Control Suite benchmark. Moreover, we…
Wide residual networks generalize well with uniform convergence to RNTK as width increases.
problem Understanding the generalization ability of wide residual networks.
method Uniform convergence of residual network kernel to residual neural tangent kernel (RNTK).
result Generalization error converges to kernel regression error with respect to RNTK.
The paper studies residues of manifolds and their applications in geometry.
problem Understanding the residues of manifolds and their geometric implications.
method Analytic continuation and Möbius invariance of residues, introduction of relative and weighted residues.
result Scalar curvature, mean curvature, and Euler characteristic can be expressed in terms of residues.