Tootfinder

CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms
Georg Kruse, Rodrigo Coelho, Andreas Rosskopf, Robert Wille, Jeanette Miriam Lorenz
https://arxiv.org/abs/2507.07593

CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms
At the interception between quantum computing and machine learning, Quantum Reinforcement Learning (QRL) has emerged as a promising research field. Due to its novelty, a standardized and comprehensive collection for QRL algorithms has not yet been established. Researchers rely on numerous software stacks for classical Reinforcement Learning (RL) as well as on various quantum computing frameworks for the implementation of the quantum subroutines of their QRL algorithms. Inspired by the CleanRL l…

"While crop seed vaults are common around the world, nurseries for wild and native plants are rare, and many plant species quietly become extinct. This marks #Gurukula out as a Noah’s ark for endangered plant species."

Tool-integrated Reinforcement Learning for Repo Deep Search
Zexiong Ma, Chao Peng, Qunhong Zeng, Pengfei Gao, Yanzhen Zou, Bing Xie
https://arxiv.org/abs/2508.03012 https://

Tool-integrated Reinforcement Learning for Repo Deep Search
Issue localization, the process of identifying code locations that need modification to resolve software issues, is a critical yet challenging task in software development. The semantic gap between natural language issue descriptions and faulty code requires complex multi-hop reasoning through code dependencies. Existing LLM-based agents attempt to address this by integrating repository retrieval tools. However, this transforms issue localization into a demanding task we call Repo Deep Search, …

Die Grünen legen es in #BadenWürttemberg anscheinend darauf an, sich überflüssig zu machen (= sich hübsch zu machen als künftiger kleiner Koalitionspartner). Ja, man hat mehr parlamentarische Kontrolle reinverhandelt, und will eine europäische Lösung vorantreiben, aber erstmal ist die Polizei schon dabei, die

Streit um umstrittene Analyse-Software von Palantir: Polizei in BW darf Gotham nutzen
Die Polizei kauft für viele Millionen eine umstrittene Software, die sie noch gar nicht nutzen darf. Das sorgte bei den Grünen für großen Unmut. Jetzt gibt es eine Lösung.

Replaced article(s) found for cs.SE. https://arxiv.org/list/cs.SE/new
[1/1]:
- Enhancing Code LLMs with Reinforcement Learning in Code Generation: A Survey
Junqiao Wang, et al.

Constant-depth circuits for polynomial GCD over any characteristic
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
https://arxiv.org/abs/2506.23220

Constant-depth circuits for polynomial GCD over any characteristic
We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of Andrews & Wigderson who showed such an upper bound over fields of zero or large characteristic. Our proofs are based on a recent work of Bhattacharjee, Kumar, Rai, Ramanathan, Saptharishi \& Saraf that shows closure of constant depth algebraic circuits und…

Motivando el uso y aprendizaje de Bash a trav\'es de concursos de programaci\'on
Luis Costero, Jorge Villarrubia, Francisco D. Igual
https://arxiv.org/abs/2506.00105

Motivando el uso y aprendizaje de Bash a través de concursos de programación
Command line learning and Bash usage are fundamental skills in systems administration, software development, and data science environments. However, their teaching has been neglected in many curricula, despite its relevance in the professional field. To address this gap, we developed an interactive competition that encourages students to improve their Bash skills through practical and competitive challenges. This gamified approach seeks to motivate autonomous learning and reinforce command line…

Wide Area Linear Optical Polarimeter Control Software
John A. Kypriotakis, Bhushan Joshi, Dmitry Blinov, Sebastian Kiehlmann, Ramya M. Anche, Ioannis Liodakis, Myrto Falalaki, Tuhin Ghosh, Eirik Gjerl{\o}w, Siddharth Maharana, Nikolaos Mandarakas, Georgia V. Panopoulou, Katerina Papadaki, Vasiliki Pavlidou, Timothy J. Pearson, Vincent Pelgrims, Stephen B. Potter, Chaitanya V. Rajarshi, A. N. Ramaprakash, Anthony C. S. Readhead, Raphael Skalidis, Konstantinos Tassis

Wide Area Linear Optical Polarimeter Control Software
The WALOPControl software is designed to facilitate comprehensive control and operation of the WALOP (Wide Area Linear Optical Polarimeter) polarimeters, ensuring safe and concurrent management of various instrument components and functionalities. This software encompasses several critical requirements, including control of the filter wheel, calibration half-wave plate, calibration polarizer, guider positioning, focusers, and 4 concurrent CCD cameras. It also manages the host telescope and dome…

A Survey of Reinforcement Learning for Software Engineering
Dong Wang, Hanmo You, Lingwei Zhu, Kaiwei Lin, Zheng Chen, Chen Yang, Junji Yu, Zan Wang, Junjie Chen
https://arxiv.org/abs/2507.12483

A Survey of Reinforcement Learning for Software Engineering
Reinforcement Learning (RL) has emerged as a powerful paradigm for sequential decision-making and has attracted growing interest across various domains, particularly following the advent of Deep Reinforcement Learning (DRL) in 2015. Simultaneously, the rapid advancement of Large Language Models (LLMs) has further fueled interest in integrating RL with LLMs to enable more adaptive and intelligent systems. In the field of software engineering (SE), the increasing complexity of systems and the ris…

Closure under factorization from a result of Furstenberg
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
https://arxiv.org/abs/2506.23214

Closure under factorization from a result of Furstenberg
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then all its factors can be computed by small constant-depth circuits or formulas respectively. Our result turns out to be an elementary consequence of a fundamental and surprising result of Furstenberg from the 1960s, which gives a non-iterative description of t…