Pith. sign in

INDEX

Every paper Pith has read and judged, in one searchable index.

9,727 reviewed papers in stat · newest first · page 18

Pith rank means recent reader upvotes with each upvote's ranking weight halved after 24 hours. The archive itself is sorted by arXiv submission date.

  1. cs.LG arXiv submitted 2026-07-13
    One Gumbel pool reuses every K-subset for unbiased WOR Max@K

    Melveena Jolly +1 · “Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective”

    2607.11146
  2. physics.geo-ph arXiv submitted 2026-07-13
    Swarm quakes leave a multiscaling fingerprint tectonic ones lack

    Cataldo Godano +1 · “A Multiscaling Fingerprint of Earthquake Diffusion in Seismic Swarms”

    2607.11142
  3. stat.ME arXiv submitted 2026-07-13
    Closed-form tests decide approximate independence in tables

    Vladimir Ostrovski · “New Equivalence Tests for Approximate Independence in Contingency Tables”

    2607.11130
  4. cs.CV arXiv submitted 2026-07-13
    Difference-based gates beat attention in U-Net fusion

    Kai Li +5 · “Difference-Driven Gating: Adaptive Feature Fusion for U-Net Decoder”

    2607.11096
  5. math.ST arXiv submitted 2026-07-13
    Closed-form lower bound for distances on infinite-dimensional manifolds

    Amit Vishwakarma +1 · “A Tractable Pseudo-Metric on Non-Parametric Exponential Statistical Manifolds via SPD Geometry”

    2607.11092
  6. cs.LG arXiv submitted 2026-07-13
    Neighbor fusion cuts molecular error 19% at test time

    Cameron Gruich +3 · “Adapting Evidential Neural Networks to Test-Time Neighbor Fusion Improves Molecular Property Prediction”

    2607.11091
  7. econ.GN arXiv submitted 2026-07-13
    Equal weights win when forecast errors share one eigenstructure

    Han Feng +3 · “When and Why Na\"ive Diversification Works: A Simple Diagnostic Strategy”

    2607.11054
  8. math.ST arXiv submitted 2026-07-13
    Fuse experiment recommendations by expected information loss

    Nagananda K G +2 · “Regret-weighted Bayes Fusion for Distributed Experimental Design”

    2607.11023
  9. math.OC arXiv submitted 2026-07-13
    Deterministic policies unlock model-free learning for extended mean-field control

    Ziheng Cheng +3 · “Actor-Critic Learning for Extended Mean Field Control with Deterministic Policies”

    2607.11005
  10. cs.LG arXiv submitted 2026-07-12
    DQN beats tuned routing by 13.3 bps when AMM fees reprice

    Wen-Ting Wang · “Reinforcement Learning for Execution under Dynamic Fees in a Closed-Loop DEX Simulator”

    2607.10960
  11. cs.LG arXiv submitted 2026-07-12
    One learning rate works when training is extended

    Jianhao Ma +1 · “WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training”

    2607.10959
  12. cs.LG arXiv submitted 2026-07-12
    One process unifies masked, continuous, and hybrid diffusion

    Pascal Jutras-Dub\'e +4 · “Sticky Jump Diffusions: A Unifying View of Masked, Continuous, and Hybrid Diffusion”

    2607.10951
  13. stat.ML arXiv submitted 2026-07-12
    Post-PA anomaly metrics still gamed by no-skill scores

    Zongye Lyu · “Did We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection”

    2607.11969
  14. stat.ML arXiv submitted 2026-07-12
    Best-of-N reporting inflates ROC and affiliation anomaly metrics

    Zongye Lyu · “Did We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection”

    2607.11969
  15. cs.LG arXiv submitted 2026-07-12
    Bandit PCA regret settles at r sqrt(d T)

    Mo\"ise Blanchard +2 · “Bandit PCA with Minimax Optimal Regret”

    2607.10936
  16. cs.LG arXiv submitted 2026-07-12
    Bandit PCA regret rate settled at r√(dT)

    Mo\"ise Blanchard +2 · “Bandit PCA with Minimax Optimal Regret”

    2607.10936
  17. stat.AP arXiv submitted 2026-07-12
    Propagated LLM signals beat direct news in market simulations

    Lin Zhang · “LLM-Enhanced Dynamic Financial Knowledge Graphs for Cross-Entity Signal Propagation and alpha discovery”

    2607.10932
  18. q-bio.NC arXiv submitted 2026-07-12
    Three eigenmodes align brains 30 imes faster for better decoding

    Pierre-Louis Barbarant +2 · “Fast Whole-Brain, Geometry-Aware Functional Alignment for Cross-Subject Decoding”

    2607.10931
  19. cs.LG arXiv submitted 2026-07-12
    Latent treatment effects are eigenvalues of one proxy operator

    Hamza Virk +2 · “The Spectral Structure of Latent Treatment Effects”

    2607.10926
  20. stat.ME arXiv submitted 2026-07-12
    Beta-fitted leverages tame explosive HC standard errors

    Marina O. Cunha +2 · “A Beta-Based Heteroskedasticity-Consistent Covariance Matrix Estimator”

    2607.10905
  21. cs.AI arXiv submitted 2026-07-12
    Topology keeps geopolymer inverse design on the feasible manifold

    Giansalvo Cirrincione +1 · “Incremental Transformer for Surrogate-Based Inverse Design of Geopolymer Mixtures”

    2607.10896
  22. stat.ME arXiv submitted 2026-07-12
    Flywheel A/B tests fixed with a geometric log-based correction

    Weitao Cheng +3 · “Causal Estimation of Share-Induced Engagement with Flywheel Effects”

    2607.10820
  23. math.ST arXiv submitted 2026-07-12
    Skip MCMC: push linear posteriors to nonlinear imaging UQ

    Anuj Abhishek +2 · “An Efficient Bayesian Framework for Uncertainty Quantification in Nonlinear Imaging Inverse Problems”

    2607.10817
  24. math.PR arXiv submitted 2026-07-12
    Singular-value gaps control non-reversible mixing times

    Andreas Eberle +1 · “Relaxation times of non-reversible Markov processes”

    2607.10801
  25. stat.ME arXiv submitted 2026-07-12
    Association screening inflates MR false positives

    Litao Jia +1 · “When Screening Misleads: A Robust Mendelian Randomization Test for Reliable Causal Discovery”

    2607.10755
  26. stat.ME arXiv submitted 2026-07-12
    GP neurons train without ever storing covariances

    Mengyang Gu · “GNet: A scalable and flexible Gaussian process network with nonparametric neurons”

    2607.10735
  27. stat.ME arXiv submitted 2026-07-12
    Fast filter makes Gaussian-process networks scale to 95k points

    Mengyang Gu · “GNet: A scalable and flexible Gaussian process network with nonparametric neurons”

    2607.10735
  28. q-fin.RM arXiv submitted 2026-07-12
    Ordinary generative models can sample extremes beyond data

    Mantu Gupta +1 · “An Extreme Value Perspective on Learning Stress Laws”

    2607.10700
  29. stat.ML arXiv submitted 2026-07-12
    Edge products and radial rotary attention top Matbench

    Zemin Xu +2 · “Edge Cluster Expansion with Radial Rotary Attention for Interatomic Potentials”

    2607.10664
  30. stat.AP arXiv submitted 2026-07-12
    Network topology recovers inventory without SME labels

    Tiancheng Gao +3 · “Inferring Inventory Dynamics from Supply Chain Networks: A Graph Learning Approach with Autonomous Validation”

    2607.10642
  31. stat.ME arXiv submitted 2026-07-12
    ICC, not design effect, tells when survey CV matters

    M. Ehsan Karim +1 · “When Does Survey-Aware Cross-Validation Matter? The ICC, Not the Design Effect”

    2607.10634
  32. stat.ML arXiv submitted 2026-07-12
    Every local stationary point hits the sparse demixing rate

    Raziyeh Takbiri · “Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization”

    2607.10618
  33. econ.EM arXiv submitted 2026-07-12
    Penalized GMM adjusts suspect networks

    Tadao Hoshino · “Network-Adjusted GMM Estimation under Network Uncertainty”

    2607.10613
  34. stat.ML arXiv submitted 2026-07-12
    Depth beats width for analytic ReLU approximation

    Yanming Lai +2 · “Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width”

    2607.10589
  35. cs.LG arXiv submitted 2026-07-12
    Local walks solve bandits on changing graphs under mixing

    Sourav Chakraborty +3 · “Learning from Local Walks on Dynamic Graphs with Bandit Feedback”

    2607.10571
  36. cs.LG arXiv submitted 2026-07-12
    One walk finds the best node in a shifting graph

    Sourav Chakraborty +3 · “Learning from Local Walks on Dynamic Graphs with Bandit Feedback”

    2607.10571
  37. stat.ME arXiv submitted 2026-07-12
    One tabular row is enough to detect its watermark

    Dongyu Cui +1 · “Observation-Level Watermarking and Detection for Tabular Data”

    2607.10554
  38. stat.ML arXiv submitted 2026-07-12
    Transport that looks at neighbors fixes short-text clusters

    Zhihao Yao +3 · “Beyond Looking Up, Try Looking Around: Harmonizing Global Structure and Local Consistency in Optimal Transport for Short Text Clustering”

    2607.10548
  39. stat.ML arXiv submitted 2026-07-12
    Shared nets cut mediation SE by ~1.5× under unmeasured confounding

    Roberto Faleh +2 · “Representation Learning for Semiparametric Causal Mediation Analysis under No Essential Heterogeneity”

    2607.10540
  40. stat.AP arXiv submitted 2026-07-12
    Average both windows when you do not know which fits

    Sizhe Chen +1 · “Age-specific demographic modeling and forecasting: Rolling window, expanding window, or both?”

    2607.10527
  41. econ.EM arXiv submitted 2026-07-12
    Minimax rules often fail once the data arrive

    Cheaheon Lim +1 · “Dynamically Consistent Statistical Decisions”

    2607.10519
  42. stat.ME arXiv submitted 2026-07-12
    Proxies restore front-door effects when mediators are confounded

    Helen Guo +2 · “Proximal Identification and Estimation in Front-Door Causal Structures with Unobserved Confounding of the Mediator”

    2607.10515
  43. stat.ME arXiv submitted 2026-07-11
    Ridge-and-PC CCA tests stay valid when dimensions exceed sample size

    Haoran Li · “Adaptable Regularized CCA Tests for Independence of High-Dimensional Random Vectors”

    2607.10500
  44. cs.LG arXiv submitted 2026-07-11
    Survival models can learn study cutoffs instead of true risk

    Yanqi Xu +4 · “Pitfalls of Administrative Censoring in Survival Models with Time-Indexed Inputs”

    2607.10466
  45. stat.ML arXiv submitted 2026-07-11
    Expert edge knowledge cuts causal-discovery tests by 10x

    M\'aty\'as Schubert +3 · “Integrating Background Knowledge for Scalable Causal Discovery”

    2607.10456
  46. stat.CO arXiv submitted 2026-07-11
    Quantile regression without MCMC: 50x faster

    Tomas Rodriguez Taborda +1 · “Scalable Bayesian Quantile Regression via EM and INLA: The EM-INLA Algorithm”

    2607.10432
  47. stat.CO arXiv submitted 2026-07-11
    Bayesian quantile regression runs 15–50× faster without MCMC

    Tomas Rodriguez Taborda +1 · “Scalable Bayesian Quantile Regression via EM and INLA: The EM-INLA Algorithm”

    2607.10432
  48. stat.ML arXiv submitted 2026-07-11
    Two-stage network adds forecast uncertainty without losing accuracy

    Jongwook Kim +1 · “TSCoNet: A Two-Stage Copula CNN-LSTM for Uncertainty-Aware Spatio-Temporal Forecasting”

    2607.10410
  49. stat.CO arXiv submitted 2026-07-11
    Any ordered confidence bound is a relaxation of one optimizatio

    My Phan +1 · “Towards Automated Confidence Bound Provers and Searchers”

    2607.10379
  50. stat.AP arXiv submitted 2026-07-11
    No fixed query count makes AI citation rankings trustworthy

    Ronald Sielinski · “From Stochastic to Stable: Rank Stability and Structural Sufficiency in AI Visibility Measurement”

    2607.10341