2 papers
cs.SE2025
Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)
Anastasios Antoniadis, Ilias Tsatiris, Nevill Grech +1
In this work, we present a simple, uniform, and elegant solution to the problem, with stunning practical effectiveness and application to virtually any Datalog-based analysis. The…
cs.LG2022
Competing Mutual Information Constraints with Stochastic Competition-based Activations for Learning Diversified Representations
Konstantinos P. Panousis, Anastasios Antoniadis, Sotirios Chatzis
This work aims to address the long-established problem of learning diversified representations. To this end, we combine information-theoretic arguments with stochastic competition-…