Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through July 28, 2026 — 14:14:44 EST

0

Posted in cs.LG · 2026-01-01 · Mattia Billa, Giovanni Orlandi, Veronica Guidetti, Federica Mandreoli

Interpretable ML Under the Microscope: Performance, Meta-Features, and the Regression-Classification Predictability Gap

As machine learning models are increasingly deployed in high-stakes domains, the need for interpretability has grown to meet strict regulatory and accountability constraints. Despite this interest, systematic evaluations of inherently interpretable models for tabular data remain scarce and often focus solely on aggregated performance....

💬 0 commentsarXiv:2601.00428v2PDF
0

Posted in cs.LG · 2026-01-01 · Rares Folea, Radu Iacob, Emil Slusanschi, Traian Rebedea

Complexity-based code embeddings

This paper presents a generic method for transforming the source code of various algorithms to numerical embeddings, by dynamically analysing the behaviour of computer programs against different inputs and by tailoring multiple generic complexity functions for the analysed metrics. The used algorithms embeddings are based on...

💬 0 commentsarXiv:2601.00924v1PDF
0

Posted in cs.NE · 2026-01-01 · Md Zesun Ahmed Mia, Malyaban Bal, Abhronil Sengupta

RMAAT: Astrocyte-Inspired Memory Compression and Replay for Efficient Long-Context Transformers

The quadratic complexity of self-attention mechanism presents a significant impediment to applying Transformer models to long sequences. This work explores computational principles derived from astrocytes-glial cells critical for biological memory and synaptic modulation-as a complementary approach to conventional architectural...

💬 0 commentsarXiv:2601.00426v2PDF
0

Posted in cs.NE · 2026-01-01 · Oguzhan Yildirim

Evolving Personalities in Chaos: An LLM-Augmented Framework for Character Discovery in the Iterated Prisoners Dilemma under Environmental Stress

Standard simulations of the Iterated Prisoners Dilemma (IPD) operate in deterministic, noise-free environments, producing strategies that may be theoretically optimal but fragile when confronted with real-world uncertainty. This paper addresses two critical gaps in evolutionary game theory research: (1) the absence of realistic...

💬 0 commentsarXiv:2601.02407v1PDF
0

Posted in cs.LG · 2026-01-01 · Shengjun Zhang, Zhang Zhang, Chensheng Dai, Yueqi Duan

E-GRPO: High Entropy Steps Drive Effective Reinforcement Learning for Flow Models

Recent reinforcement learning has enhanced the flow matching models on human preference alignment. While stochastic sampling enables the exploration of denoising directions, existing methods which optimize over multiple denoising steps suffer from sparse and ambiguous reward signals. We observe that the high entropy steps enable more...

💬 0 commentsarXiv:2601.00423v1PDF
0

Posted in cs.CV · 2026-01-01 · Kazuma Miura, Sarthak Pathak, Kazunori Umeda

Robust Assembly Progress Estimation via Deep Metric Learning

In recent years, the advancement of AI technologies has accelerated the development of smart factories. In particular, the automatic monitoring of product assembly progress is crucial for improving operational efficiency, minimizing the cost of discarded parts, and maximizing factory productivity. However, in cases where assembly...

💬 0 commentsarXiv:2601.00422v1PDF
0

Posted in cs.AI · 2026-01-01 · Alessio Di Rubbo, Mattia Neri, Remo Pareschi, Marco Pedroni, Roberto Valtancoli, Paolino Zica

Can Semantic Methods Enhance Team Sports Tactics? A Methodology for Football with Broader Applications

This paper explores how semantic-space reasoning, traditionally used in computational linguistics, can be extended to tactical decision-making in team sports. Building on the analogy between texts and teams -- where players act as words and collective play conveys meaning -- the proposed methodology models tactical configurations as...

💬 0 commentsarXiv:2601.00421v2PDF
0

Posted in cs.DC · 2026-07-07 · James Thompson, Wayne Mesard, Jesse Butler, Sri Saran Balaji Rajakumar, Henry Wang

Seekable OCI: Lazy-Loading Container Images via Range-Request Indexing

Container image pulling accounts for the majority of pod startup time in Kubernetes environments. Standard pull downloads the entire image before the container can start, even when the application accesses only a fraction of the image content at startup. We present SOCI (Seekable OCI), a lazy-loading architecture that enables...

💬 0 commentsarXiv:2607.06868v1PDF
0

Posted in cs.CG · 2026-07-07 · Lenny Liu, Jihan Wang

$(5+ε)$-Approximation of Fréchet Distance in Strongly Subquadratic Time

We give randomized $(5+ε)$-approximation algorithms for both the continuous and discrete Fréchet distances on arbitrary two polygonal curves $τ$ and $σ$ in $\mathbb R^d$ for fixed $d$, with $n$ and $m\le n$ vertices respectively. Our algorithm for continuous Fréchet runs in $\widetilde O_{d,ε}(n m^{8/9})$ time, and our algorithm for...

💬 0 commentsarXiv:2607.06864v2PDF
0

Posted in cs.CR · 2026-07-07 · Jannatul Ferdous, Rafiqul Islam, Md Zahidul Islam

Auditable Machine Unlearning for Privacy-Compliant Ransomware Detection Using Multi-Shard SISA and Deep Reinforcement Learning

Ransomware poses an escalating cybersecurity threat as attackers continuously modify behavioral patterns to evade static defenses. Although existing machine learning-based detectors often achieve strong predictive performance, they generally assume fixed training data and do not support the selective removal of previously learned...

💬 0 commentsarXiv:2607.06860v1PDF
0

Posted in cs.CV · 2026-07-07 · Michael King, Aravindh Mahendran, Matthew Koichi Grimes, Fedor Kitashov, Adham Elarabawy, Pedro Velez, Maks Ovsjanikov, Viorica Pătrăucean

Gen4U: Unifying Video Generation and Understanding via Diffusion

Prior work suggests that diffusion representations capture low-level geometry but struggle with high-level semantics. We demonstrate that state-of-the-art video diffusion models overcome this limitation. By systematically probing their intermediate activations using recent mutual-kNN alignment metrics, we reveal a highly structured...

💬 0 commentsarXiv:2607.06856v1PDF
0

Posted in cs.SE · 2026-07-07 · Nicolas Koller, Andreas u. Schmidt

REFORGE: A Method for Benchmarking LLMs' Reverse Engineering Capabilities in Decompiled Binary Function Naming

Large language models (LLMs) are increasingly applied to reverse-engineering tasks, and recent threat-intelligence reporting shows them operating inside live offensive-security workflows. Claims about their capability, however, outpace our ability to measure it. Existing benchmarks for LLM-assisted binary analysis treat the...

💬 0 commentsarXiv:2607.07738v1PDF
0

Posted in cs.LG · 2026-07-07 · Josip Jukić, Ivan Titov

Geometric Self-Distillation for Reasoning Generalization

On-policy distillation is a practical post-training recipe for large language models, supplying dense teacher supervision on the student's own trajectories. In privileged-context self-distillation, teacher and student are the same model conditioned on the same prefix, but the teacher also sees a hint or the full solution trace. This...

💬 0 commentsarXiv:2607.06855v1PDF
0

Posted in cs.LG · 2026-07-07 · Nima Kelidari, Mohammadsaeed Haghi, Mahdi Salmani

A Gold-Standard Study of What Makes a Lightweight Game-Playing Agent Strong

Reinforcement learning agents for imperfect-information card games are only as strong as the opponents they train against, and they are hard to grade, since they beat a random opponent over 99 percent of the time and only tie copies of themselves. So we build a strong, fixed, rule-based expert for Gin Rummy and use it only as a...

💬 0 commentsarXiv:2607.06854v1PDF
0

Posted in cs.CC · 2026-07-07 · Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Xin Zheng

On the Approximability of Parameterized Minimum Monotone Satisfying Assignment

The parameterized Minimum Monotone Satisfying Assignment ($k$-MMSA) problem asks whether a monotone Boolean circuit admits a satisfying assignment of Hamming weight at most $k$. The MMSA hierarchy is defined by allowing a bounded number of alternations between AND and OR gates in the circuit. While the polynomial-time approximability...

💬 0 commentsarXiv:2607.06852v1PDF