Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.
problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.
New CDC scheme avoids intergenerational subsidies, offering better outcomes.
problem Intergenerational cross-subsidies in UK CDC schemes.
method Collective-Drawdown CDC approach using explicit insurance contracts.
result Better pension outcomes with no intergenerational cross-subsidies.
Perfect spike detection method derived and benchmarked.
problem Missing spikes in neuronal network simulations.
method Time-inverted dynamics to test threshold crossing.
result Method can be faster than alternative perfect tests.
Study curvature and torsion from cross-ratios in discrete curves.
problem Define curvature and torsion for discrete curves using cross-ratios.
method Use Möbius invariant point-insertion-rule to construct circles and express torsion using cross-ratio.
result Discrete curvature and torsion defined using cross-ratios converge to smooth curvature and torsion as sampling density increases.
In order to study the geometry of interest rates market dynamics, Malliavin, Mancino and Recchioni [A non-parametric calibration of the HJM geometry: an application of Itô calculus to financial statistics, {\it Japanese Journal of Mathematics}, 2, pp.55--77, 2007] introduced a scheme, which is based on the Fourier Seri…
Efficient cross-validation method for Echo State Networks reduces validation time complexity.
problem Hyper-parameter tuning and validation for Echo State Networks (ESNs).
method Proposes several k-fold cross-validation schemes for ESNs with an efficient algorithm. result Cross-validation of ESNs can be done for the same time complexity as a single split validation.
Paper proposes efficient GP hyper-parameter optimization methods.
problem Efficient hyper-parameter optimization for Gaussian process regression.
method Cross-validation and ADMM for O(n2) complexity. result Proposed methods outperform traditional ML-based routines.
Study detects synthetic tabular data across different tables.
problem Detecting synthetic tabular data in varied tables.
method Four table-agnostic detectors combined with preprocessing schemes.
result Cross-table learning possible with naive preprocessing, but cross-table transfer challenging.
A novel tensor measurement scheme Cross enables efficient low-rank tensor completion with optimal sample complexity.
problem Efficiently recover low-rank tensors from a minimal number of measurements.
method Cross tensor measurement scheme for low-rank tensor completion.
result Third order tensor of Tucker rank-(r1,r2,r3) can be recovered from r1r2r3+r1(p1−r1)+r2(p2−r2)+r3(p3−r3) measurements, matching sample complexity lower-bound. A new explicit scheme calculates XVA adjustments using neural networks and conditional expectations.
problem Calculating cross valuation adjustments (XVA) in realistic financial scenarios.
method Simulation/regression scheme for BSDEs, using neural networks and quantile regressions.
result The scheme outperforms Picard iterations in high-dimensional and hybrid market risks.
Algorithm identifies and corrects noisy labels using Gaussian process regression.
problem Detecting and correcting real-valued noisy labels from mixed data.
method Gaussian process regression with heteroscedastic noise model and leave-one-out cross-validation.
result The method can pinpoint corrupted sample points and improve regression models.
Adaptive importance sampling for estimating point process statistics.
problem Estimating the expected value of a statistic of a locally stable point process.
method Adaptive importance sampling with Poisson point processes and cross-entropy minimization.
result The proposed estimator converges to the target value almost surely and is asymptotically normal.
DoCoFL compresses model updates for cross-device federated learning.
problem Downlink compression for cross-device federated learning where clients may appear only once.
method Proposes DoCoFL framework for downlink compression in cross-device federated learning.
result Significant bi-directional bandwidth reduction with competitive accuracy.
Improved cross-lingual document retrieval using regularized Wasserstein distance.
problem Cross-lingual document retrieval (CLDR) challenges.
method Extending Word Mover's Distance with term-weighting schemes and entropic regularization.
result Remarkable improvements in Mean Reciprocal Rank (MRR) compared to baselines.
Linear-cost unbiased estimates for complex models via couplings.
problem High-dimensional Bayesian models with crossed effects and matrix factorization.
method Coupled Gibbs samplers for linear computational cost.
result Unbiased posterior estimates at linear cost.
New training scheme reduces adversarial examples by increasing decision boundary margin.
problem Vulnerability of neural networks to adversarial examples.
method Differential training using a loss function on feature differences.
result Differential training significantly reduces adversarial examples.
Efficient CV for ESNs improves time series predictions.
problem Lack of CV in time series modeling, especially for ESNs.
method Two-level optimizations for k-fold CV of ESNs. result Proposed CV schemes give better and more stable test performance.
Cross-validation estimates model performance on unseen data, not training data.
problem Understanding how cross-validation estimates prediction error and its limitations.
method Analyzing linear models and popular prediction error estimates, introducing nested cross-validation.
result Cross-validation estimates the average prediction error of models fit on other unseen training sets, not the model at hand.
A {\em good drawing\/} of Kn is a drawing of the complete graph with n vertices in the sphere such that: no two edges with a common end cross; no two edges cross more than once; and no three edges all cross at the same point. Gioan's Theorem asserts that any two good drawings of Kn that have the same rotations …
Study Transformer layers under cross-entropy training using mean field control.
problem Understanding the behavior of Transformer layers in cross-entropy training.
method Continuous-depth mean field control analysis, treating depth as time and layer parameters as controls.
result Derivation of a Pontryagin condition for the limiting population problem, involving the softmax residual.
Improves test set performance and reduces out-of-sample disappointment for unstable models.
problem Ensuring strong test set performance via cross-validation for unstable models.
method Nested k-fold cross-validation with hyperparameter selection based on a weighted sum of cross-validation metric and model stability measure.
result Improves out-of-sample MSE for sparse ridge regression and CART by 4% and 2% respectively, compared to k-fold cross-validation.
Paper proposes efficient tensor completion method using Gaussian Process.
problem Tensor completion in high-dimensional data with unknown smooth functions.
method Gaussian Process Regression for initialization and TT-cross approximation for tensor rank selection.
result Improved reconstruction error compared to random initialization.
Paper proposes a harmonized approach to multimodal learning using GPLVMs.
problem Modality heterogeneity in multimodal data.
method Develops a novel learning scheme called Harmonization to jointly learn latent model parameters from different modalities.
result Experimental results show superior performance in cross-modal retrieval tasks.
A new neural network initialization method is proposed for faster and more accurate training.
problem Efficient initialization for training multi-layer feedforward neural networks.
method Initialization based on Stein's identity, using eigenvectors of cross-moment matrix.
result The SteinGLM method is faster and more accurate than other initialization methods.
We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms based…
Diagonal Frog: High-order positivity-preserving FD schemes for anisotropic Fokker-Planck equations
problem Positivity-preserving discretizations for anisotropic Fokker-Planck equations
method Diagonal Frog discretization
result Second-order accuracy and mass conservation
A new method avoids overfitting in network reconstruction by using the minimum description length principle.
problem Determining the optimal model complexity in network reconstruction to prevent overfitting.
method Hierarchical Bayesian inference and weight quantization based on the minimum description length principle.
result The method yields increased accuracy in reconstructing both artificial and empirical networks.
Optimal transport learns Riemannian metrics for evolving probability measures.
problem Learning metrics for evolving probability measures on Riemannian manifolds.
method Neural parametrization of a metric tensor via optimal transport, alternating optimization scheme.
result Improved trajectory inference on scRNA and bird migration data.
AAggFF improves federated learning fairness through sequential decision making.
problem Achieving client-level fairness in federated learning systems.
method Unified online convex optimization framework for adaptive aggregation strategies.
result AAggFF achieves better client-level fairness in federated learning.
A new method represents rod shapes as paths in special Euclidean algebra.
problem Representing the shapes of rods and framed curves for mechanical analysis.
method Representing shapes as paths in the special Euclidean algebra.
result The method avoids expensive reconstruction and interpolation in rod mechanics.
Cross-entropy loss linked to metric learning, outperforming complex pairwise losses.
problem Improving metric learning performance without complex optimization schemes.
method Theoretical analysis linking cross-entropy to pairwise losses, showing cross-entropy as an upper bound and equivalent to mutual information maximization.
result Minimizing cross-entropy is equivalent to maximizing mutual information, leading to state-of-the-art performance.
This study benchmarks data augmentation schemes to improve CNN performance.
problem Lack of training data for deep learning models.
method Various geometric and photometric data augmentation schemes evaluated on a CNN.
result Cropping in geometric augmentation significantly improves CNN task performance.
A new method combines quantile regression, cross-conformalization, and out-of-bag predictions for valid prediction sets.
problem Valid prediction sets for classification and regression without distributional assumptions.
method Nested conformal prediction framework, combining quantile regression, cross-conformalization, and out-of-bag predictions.
result QOOB algorithm performs best or close to best on all simulated and real datasets.
Paper presents a neural network for estimating wavefronts in direction of arrival scenarios.
problem Estimating the number of wavefronts in direction of arrival scenarios.
method Cross-entropy trained multilayer neural network for online adaptation of antenna array imperfections.
result The method outperforms classical model order selection schemes in accuracy, especially at low signal-to-noise-ratios.
The purpose of this paper is to study the shapes and stabilities of bio-membranes within the framework of exterior differential forms. After a brief review of the current status in theoretical and experimental studies on the shapes of bio-membranes, a geometric scheme is proposed to discuss the shape equation of closed…
The paper proposes a new dictionary learning method for faster and more accurate image classification.
problem Efficient and accurate image classification with compact dictionaries.
method Cross-label suppression and group regularization to learn a discriminative dictionary.
result The proposed method achieves better classification accuracy and computational efficiency compared to existing methods.
New method improves model risk prediction using cross-audit projection.
problem Over-optimism in K-fold CV for binary classification. method Cross-audit projection (CAP) procedure combining resampling and asymptotic bias correction.
result CAP estimator achieves second-order asymptotic unbiasedness.
Aggregates predictions from multiple regression models using random projections and kernel methods.
problem Combining predictions from multiple regression models to improve accuracy.
method Random projection of high-dimensional feature space, followed by kernel-based consensual aggregation.
result The aggregation scheme performs similarly to using the original high-dimensional features, with high probability.
ACV improves structured data CV, handling dependence and noisy initial fits.
problem Structured data CV is slow due to expensive algorithm re-runs.
method Extend ACV to handle dependence and noisy initial fits.
result ACV provides accurate and efficient CV for structured data.
Unified framework improves cross-corpus EEG emotion recognition by aligning prototypes and refining decision boundaries.
problem Cross-corpus EEG emotion recognition suffers from performance degradation due to physiological variability and device inconsistencies.
method Prototype-driven Adversarial Alignment (PAA) framework with three configurations: local, contrastive, and boundary-aware.
result State-of-the-art performance improvements across four cross-corpus evaluation protocols.
New framework improves E-commerce sales forecasts.
problem Short sales times series in E-commerce.
method Global model using Tree Boosting Methods.
result Outperforms state-of-the-art models on real dataset.
Tuning hyperparameters of learning algorithms is hard because gradients are usually unavailable. We compute exact gradients of cross-validation performance with respect to all hyperparameters by chaining derivatives backwards through the entire training procedure. These gradients allow us to optimize thousands of hyper…
Recent advances in statistical theory, together with advances in the computational power of computers, provide alternative methods to do mass-univariate hypothesis testing in which a large number of univariate tests, can be properly used to compare MEEG data at a large number of time-frequency points and scalp location…
MoCA uses a novel autoencoder to analyze multi-modal health data.
problem Challenges in analyzing continuous multi-modal health data from wearable devices.
method Proposes MoCA, a self-supervised learning framework combining transformer and masked autoencoder methods.
result Demonstrates strong performance boosts across reconstruction and classification tasks.
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect…
This paper optimizes PCE for efficient surrogate modeling in engineering.
problem Efficiently selecting polynomial regressors for surrogate modeling in computationally expensive models.
method Three state-of-the-art basis-adaptive sparse PCE methods are compared and analyzed.
result Automatic selection of the best solver and basis-adaptive scheme improves surrogate model accuracy.
Enhances learning of structured distributions using nonlinear denoising score matching.
problem Learning structured distributions from noisy data.
method Latent Nonlinear Denoising Score Matching (LNDSM) integrating nonlinear dynamics with VAE-based latent score matching.
result LNDSM achieves superior sample quality and variability compared to structure-agnostic methods.
Optimizes personalized medicine prediction by individual tuning.
problem Predicting individual drug responses using genomic information.
method Introduces a new ridge estimator and tuning parameter calibration scheme.
result Optimal in terms of oracle inequalities, fast, and highly effective.