Awesome Statistics — Computation

Key papers

• Finding Most Influential Sets (2026)
  Lucas D. Konrad et al.
  5.01
• Online Convex Optimization with Sublinear Noisy Probes (2026)
  Simone Di Gregorio et al.
  4.39
• p-PSO: A Penalized Particle Swarm Optimization Technique for Finding D-Optimal Designs with Mixed Factors in Generalized Linear Models (2026)
  Shrabanti Chowdhury et al.
  4.39
• Active Learning with Low-Rank Structure for Data Selection (2026)
  Vincent Cohen-Addad et al.
  4.39
• Strategic Feature Selection (2026)
  Jivat Neet Kaur et al.
  4.39
• FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies (2026)
  Connor Simpson et al.
  4.39
• A Human-in-the-Loop Bayesian Optimization Framework for Constraint-Aware Bioprocess Development (2026)
  Samuel Stricker et al.
  4.39
• The Complexity of Min-Max Optimization for Quadratic Polynomials (2026)
  Martino Bernasconi et al.
  3.51
• On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization (2026)
  Koen van der Blom et al.
  3.45
• A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers (2026)
  Yuxuan Linghu et al.
  3.28
• Gradient-Discrepancy Acquisition for Pool-Based Active Learning (2026)
  Mohamadsadegh Khosravani et al.
  2.00
• Computational Identifiability (2026)
  Lucius E. J. Bynum et al.
  2.00
• Spectral DPPs via NEPv: A Scalable Continuous Relaxation of Determinantal MAP for Diversity-Aware Data Selection (2026)
  Richard Yi Da Xu
  2.00
• A Solver-Free Training Method for Predict-then-Optimize (2026)
  Beichen Wan et al.
  2.00
• Comparing Linear Probes with Mahalanobis Cosine Similarity (2026)
  Zhuofan Josh Ying et al.
  2.00
• AURA: Adaptive Uncertainty-aware Refinement for LLM-as-a-Judge Auditing (2026)
  Zilong Zhang et al.
  2.00
• Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model (2026)
  Xiaoyu Li et al.
  2.00
• Data-driven sparse identification of governing PDEs via knockoff filters and multi-criteria trade-offs (2026)
  Pongpisit Thanasutives et al.
  1.94
• An In-depth Study of LLM Contributions to the Bin Packing Problem (2025)
  Julien Herrmann et al.
  1.56
• How fast can you find a good hypothesis? (2025)
  Anders Aamand et al.
  1.50
• From Sorting Algorithms to Scalable Kernels: Bayesian Optimization in High-Dimensional Permutation Spaces (2025)
  Zikai Xie et al.
  1.39
• MOSIC: Model-Agnostic Optimal Subgroup Identification with Multi-Constraint for Improved Reliability (2025)
  Wenxin Chen et al.
  1.22
• New Paradigms for Exploiting Parallel Experiments in Bayesian Optimization (2022)
  Leonardo D. Gonz\'alez and Victor M. Zavala
  —
• Controlling Continuous Relaxation for Combinatorial Optimization (2023)
  Yuma Ichikawa
  —
• Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling (2024)
  Yuma Ichikawa and Yamato Arai
  —
• Best Arm Identification with Minimal Regret (2024)
  Junwen Yang et al.
  —
• Variational autoencoders with latent high-dimensional steady geometric flows for dynamics (2024)
  Andrew Gracyk
  —
• Conditional Local Importance by Quantile Expectations (2024)
  Kelvyn K. Bladen et al.
  —