惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
D
DataBreaches.Net
K
KPMG report finds enterprise disconnect between AI and its ROI | CIO
V
Visual Studio Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog RSS Feed
Recent Announcements
Recent Announcements
The Register - Security
The Register - Security
S
Secure Thoughts
Y
Y Combinator Blog
The Last Watchdog
The Last Watchdog
L
LINUX DO - 最新话题
V2EX - 技术
V2EX - 技术
腾讯CDC
GbyAI
GbyAI
G
Google Developers Blog
博客园 - 司徒正美
博客园 - 三生石上(FineUI控件)
T
The Exploit Database - CXSecurity.com
T
Threat Research - Cisco Blogs
P
Proofpoint News Feed
Schneier on Security
Schneier on Security
Microsoft Security Blog
Microsoft Security Blog
Jina AI
Jina AI
WordPress大学
WordPress大学
aimingoo的专栏
aimingoo的专栏
MyScale Blog
MyScale Blog
Help Net Security
Help Net Security
K
Kaspersky official blog
P
Privacy & Cybersecurity Law Blog
www.infosecurity-magazine.com
www.infosecurity-magazine.com
AI
AI
MongoDB | Blog
MongoDB | Blog
Scott Helme
Scott Helme
J
Java Code Geeks
Engineering at Meta
Engineering at Meta
H
Heimdal Security Blog
H
Help Net Security
D
Darknet – Hacking Tools, Hacker News & Cyber Security
云风的 BLOG
云风的 BLOG
Microsoft Azure Blog
Microsoft Azure Blog
S
Security Affairs
TaoSecurity Blog
TaoSecurity Blog
The GitHub Blog
The GitHub Blog
Hacker News: Ask HN
Hacker News: Ask HN
Martin Fowler
Martin Fowler
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
Project Zero
Project Zero
T
The Blog of Author Tim Ferriss
Last Week in AI
Last Week in AI

stat updates on arXiv.org

Shallow ReLU$^s$ Networks in $L^p$-Type and Sobolev Spaces: Approximation and Path-Norm Controlled Generalization On Stability and Decomposition of Sample Quantiles under Heavy-Tailed Distributions Improved Baselines with Representation Autoencoders Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent Calibeating for general proper losses: A Bregman divergence approach Dimension-Free Convergence of Discrete Diffusion Models: Adjoint Equations Induce the Right Space Sample-efficient inductive matrix completion with noise and inexact side-information Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety XAI and Statistical Analysis for Reliable Intrusion Detection in the UAVIDS-2025 Dataset: From Tree to Hybrid and Tabular DNN Ensembles Reasoning Models Don't Just Think Longer, They Move Differently TabPFN-3: Technical Report Reframing preprocessing selection as model-internal calibration in near-infrared spectroscopy: A large-scale benchmark of operator-adaptive PLS and Ridge models Towards a holistic understanding of Selection Bias for Causal Effect Identification Adaptive Kernel Density Estimation with Pre-training Coreset-Induced Conditional Velocity Flow Matching RISED: A Pre-Deployment Evaluation Framework for High-Stakes AI Decision-Support Systems, with Application to Healthcare ISOMORPH: A Supply Chain Digital Twin for Simulation, Dataset Generation, and Forecasting Benchmarks Yield Curves Dynamics Using Variational Autoencoders Under No-arbitrage Model-based Bootstrap of Controlled Markov Chains Online Learning-to-Defer with Varying Experts Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification Keeping Score: Efficiency Improvements in Neural Likelihood Surrogate Training via Score-Augmented Loss Functions One-Step Generative Modeling via Wasserstein Gradient Flows Exact Stiefel Optimization for Probabilistic PLS: Closed-Form Updates, Error Bounds, and Calibrated Uncertainty A Composite Activation Function for Learning Stable Binary Representations Adaptive Calibration in Non-Stationary Environments Real vs. Semi-Simulated: Rethinking Evaluation for Treatment Effect Estimation Federated Language Models Under Bandwidth Budgets: Distillation Rates and Conformal Coverage On Variance Reduction in Learning Mean Flows When Attention Beats Fourier: Multi-Scale Transformers for PDE Solving on Irregular Domains A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models Robust and Fast Training via Per-Sample Clipping Efficient Preference Poisoning Attack on Offline RLHF Joint Energy Management and Coordinated AIGC Workload Scheduling for Distributed Data Centers: A Diffusion-Aided Reward Shaping Approach Distributional Causal Mediation via Conditional Generative Modeling A Theory of Saddle Escape in Deep Nonlinear Networks Adaptive Querying with AI Persona Priors Optimal Spatio-Temporal Decoupling for Bayesian Conformal Prediction Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback Electricity price forecasting across Norway's five bidding zones in the post-crisis era Adversarial Robustness of NTK Neural Networks Identifiability and Stability of Generative Drifting with Companion-Elliptic Kernel Families A Limit Theory of Foundation Models: A Mathematical Approach to Understanding Emergent Intelligence and Scaling Laws Conditional Score-Based Modeling of Effective Langevin Dynamics Generative Synthetic Data for Causal Inference: Pitfalls, Remedies, and Opportunities Inference of Online Newton Methods with Nesterov's Accelerated Sketching ProEval: Proactive Failure Discovery and Efficient Performance Estimation for Generative AI Evaluation Score-Repellent Monte Carlo: Toward Efficient Non-Markovian Sampler with Constant Memory in General State Spaces Learning to Emulate Chaos: Adversarial Optimal Transport Regularization Geometric Layer-wise Approximation Rates for Deep Networks S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection Beyond Coefficients: Forecast-Necessity Testing for Interpretable Causal Discovery in Nonlinear Time-Series Models Curiosity-Critic: Cumulative Prediction Error Improvement as a Tractable Intrinsic Reward for World Model Training Knowing When to Quit: A Principled Framework for Dynamic Abstention in LLM Reasoning Enhancing AI and Dynamical Subseasonal Forecasts with Probabilistic Bias Correction Zeroth-Order Optimization at the Edge of Stability Generative Augmented Inference Estimating Continuous Treatment Effects with Two-Stage Kernel Ridge Regression Rare Event Analysis via Stochastic Optimal Control Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version Beyond Fixed False Discovery Rates: Post-Hoc Conformal Selection with E-Variables Beyond Augmented-Action Surrogates for Multi-Expert Learning-to-Defer Spatio-temporal probabilistic forecast using MMAF-guided learning Conformal Policy Control The Implicit Curriculum: Learning Dynamics in RL with Verifiable Rewards Probabilistic NDVI Forecasting from Sparse Satellite Time Series and Weather Covariates Constrained Policy Optimization with Cantelli-Bounded Value-at-Risk Factorizable joint shift revisited Feature Learning Dynamics in Infinite-Depth Neural Networks Statistically-Guided Meta-Learning for Cross-Deployment Activity Recognition in Distributed Fiber-Optic Sensing DAPS++: Rethinking Diffusion Inverse Problems with Decoupled Posterior Annealing Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions Neural ARFIMA model for forecasting BRIC exchange rates with long memory Neural Stochastic Differential Equations on Compact State Spaces: Theory, Methods, and Application to Suicide Risk Modeling BOOST: A Data-Driven Framework for the Automated Joint Selection of Kernel and Acquisition Functions in Bayesian Optimization Random Walk Learning and the Pac-Man Attack Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models Post-Training Augmentation Invariance Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints Dataset-Driven Channel Masks in Transformers for Multivariate Time Series
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
[Submitted on 10 May 2026 (v1), last revised 29 Jun 2026 (this v · 2026-05-11 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:We present GenusSink, a new class of approximate generalized Sinkhorn algorithms with shortest-path-distance costs for bounded genus (e.g. planar) graphs, providing near-linear time: (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory. Graphs handled by GenusSink include in particular planar graphs and bounded-genus meshes approximating 3D objects. GenusSink addresses total quadratic time complexity of its brute-force counterpart by leveraging separator-based decomposition of graphs, computational geometry techniques, and new results on fast matrix-vector multiplications with generalized distance matrices, using, in particular, Fourier analysis and low displacement rank theory. It is inspired by recent breakthroughs in graph theory on approximating bounded genus metrics with small treewidth metrics \citep{minor-free-paper}. The graph-centric approach enables us to target optimal transport problem with the corresponding distributions defined on the manifolds approximated by weighted graphs and with cost functions given by geodesic distances. We conduct rigorous theoretical analysis of GenusSink, provide practical implementations, leveraging newly introduced in this paper \textit{separation graph field integrators} (S-GFIs) data structures and present empirical verification. GenusSink provides orders of magnitude more accurate computations than other efficient Sinkhorn algorithms, while still guaranteeing significant computational improvements, as compared to the baseline. As a by-product of the developed methods, we show that GenusSink is \textbf{numerically equivalent} to the brute-force geodesic Sinkhorn algorithm on $n$-vertex graphs with treewidth $O(\log \log (n))$ (e.g. on trees).

Submission history

From: Derek Long [view email]
[v1] Sun, 10 May 2026 22:00:42 UTC (911 KB)
[v2] Mon, 18 May 2026 11:42:00 UTC (901 KB)
[v3] Mon, 29 Jun 2026 12:50:04 UTC (1,894 KB)