ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Performance optimization”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEcs.AIcs.LGEmpiricalRecentJul 26, 2026

Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds

Jin Wang, Xi Lin, Handing Wang

This paper proposes a learning-based framework, CBA-BO, for solving expensive constrained optimization problems with continuously varying threshold settings by learning a parametric constraint model.

View →
cs.NEcs.AIRecentMay 27, 2026

Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization

Helena Stegherr, Michael Heider, Nils Meyer, Tobias Thummerer +6 more

This paper analyzes the performance and explainability requirements of evolutionary algorithms when applied to complex, real-world physics-informed optimization problems, identifying a gap between cur…

View →
cs.DCEmpiricalRecentJun 23, 2026

BiJuTy: An Interactive HPC-Aware Big Data Cluster Lifecycle Manager and Performance Assessment Utility for JupyterHub

Apurv Deepak Kulkarni, Jan Frenzel, Siavash Ghiasvand

BiJuTy is a user-friendly solution for executing complex big data processing workflows on high-performance computing systems within the Jupyter ecosystem.

View →
cs.LGcs.AIRecentJun 1, 2026

FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo

Kyunghun Nam, Sumyeong Ahn

The paper proposes FOAM, an adaptive damping method that stabilizes the Shampoo optimization algorithm by dynamically controlling damping and eigendecomposition frequency, thereby reducing staleness-i…

View →
cs.SEEmpiricalRecentJul 13, 2026

Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE

Kishan Kumar Ganguly, Tim Menzies

The authors compare and evaluate 20 software configuration optimizers based on six assumptions about the data, and find that no single optimizer outperforms others across all budgets. They propose a t…

View →
cs.SEcs.AIcs.LGRecentMay 28, 2026

AI-PROPELLER: Warehouse-Scale Interprocedural Code Layout Optimization with AlphaEvolve

Chaitanya Mamatha Ananda, Rajiv Gupta, Mircea Trofin, Aiden Grossman +3 more

AI-PROPELLER introduces a novel interprocedural code layout optimization system that uses an agentic evolutionary workflow to achieve significant, measurable performance gains in large-scale, real-wor…

View →
cs.SEEmpiricalRecentJul 8, 2026

Rethinking Code Performance Benchmarks for LLMs

Nhat Minh Le, Yisen Xu, Zhijie Wang, Tse-Hsun +1 more

This paper evaluates the performance of large language models on popular benchmarks and finds that only a small percentage of the performant implementations are significantly faster than canonical sol…

View →
cs.AIRecentMay 27, 2026

Learning When to Optimize: Verified Optimization Skills from Expert GPU-Kernel Lineages

Shuoming Zhang, Qiuchu Yu, Yangyu Zhang, Ruiyuan Xu +5 more

KLineage introduces a novel method to teach LLMs when and how to apply GPU kernel optimizations by reverse-engineering expert kernel lineages, resulting in superior optimization skills compared to exi…

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View →
cs.DCcs.SENEWEmpiricalJul 29, 2026

Hybrid Workflow Composition for Extreme-Scale Data Processing: A Case Study on the HL-LHC (Extended Version)

Alan Malta Rodrigues, Douglas Thain

This paper presents a simulation framework to optimize workflow composition in high-throughput computing environments, demonstrating up to 3.8x throughput increase and a 14.9x reduction in network ove…

View →
cs.PFcs.AREmpiricalRecentJul 16, 2026

Campaign Diagrams: Visualizing the March Through the Phases of a Workload

Toluwanimi O. Odemuyiwa, John D. Owens, Michael Pellauer, Joel S. Emer

This paper introduces campaign diagrams, a visualization technique for analyzing resource utilization and identifying bottlenecks in modern workloads.

View →
cs.AIRecentMay 27, 2026

OR-Space: A Full-Lifecycle Workspace Benchmark for Industrial Optimization Agents

Chenyu Zhou, Xinyun Lu, Jiangyue Zhao, Jianghao Lin +2 more

The paper introduces OR-Space, a novel full-lifecycle workspace benchmark designed to rigorously evaluate industrial optimization agents by simulating real-world, multi-stage OR workflows that go beyo…

View →
cs.AIRecentMay 31, 2026

"Skill issues'': data-centric optimization of lakehouse agents

Nicole Rose Schneider, Davide Ghilardi, Giacomo Piccinini, Jacopo Tagliabue

The paper introduces a data-centric optimization pipeline to improve coding agents' ability to interact with a branching lakehouse, showing significant accuracy gains by treating agent evaluation as a…

View →
cs.DCEmpiricalRecentJun 30, 2026

Performance Analysis in Parallel Programming Education: A Comparative Usability Study

Anna-Lena Roth, David James, Jonas Posner, Michael Kuhn

The paper introduces EduMPI, a learning support tool for simplifying cluster usage and performance analysis of MPI parallel programs for students.

View →
cs.DCEmpiricalRecentJul 28, 2026

CW-Ghost: Search-Free Granularity Selection for Helper-Thread Prefetching via Capacity Windows

Ya Zhang, Tong Lei, Yao Chen, Yonggang Che +3 more

This paper introduces CW-Ghost, a method for estimating cache line fill volume and determining helper-thread prefetching granularity based on cache capacity constraints.

View →
cs.NEcs.AIRecentMay 29, 2026

Linear Ordering Problem: Time for a Change

Fabrizio Fagiolo, Marco Baioletti, Valentino Santucci

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

View →
cs.NEcs.LGEmpiricalRecentJun 30, 2026

Evaluation of Population Initialization Methods for Genetic Programming-based Symbolic Regression

Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond +2 more

This paper compares the effect of different initialization methods on the accuracy and complexity of solutions in genetic programming for symbolic regression, finding no significant differences.

View →