← Search

Panagiotis D. Grontas

4 accepted papers

2026

Pinet: Optimizing hard-constrained neural networks with orthogonal projection layers

ICLR 2026oral

We introduce an output layer for neural networks that ensures satisfaction of convex constraints. Our approach, $\Pi$net, leverages operator splitting for rapid and reliable projections in the forward pass, and the implicit function theorem for backpropagation. We deploy $\Pi$net as a feasible-by-de…

Cited by 0SourcecodeScholar
2025

Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach

AISTATS 2025poster

We study the convex-concave bilinear saddle-point problem $\min_x \max_y f(x) + y^\top Ax - g(y)$, where both, only one, or none of the functions $f$ and $g$ are strongly convex, and suitable rank conditions on the matrix $A$ hold. The solution of this problem is at the core of many machine learning…

Cited by 0SourceScholar
2025

Optimizing Social Network Interventions via Hypergradient-Based Recommender System Design

ICML 2025poster

Although social networks have expanded the range of ideas and information accessible to users, they are also criticized for amplifying the polarization of user opinions. Given the inherent complexity of these phenomena, existing approaches to counteract these effects typically rely on handcrafted al…

Cited by 0SourcePDFScholar
2020

Computationally Efficient Harmonic-Based Reactive Exploration

RA-L 2020

Although Harmonic Potential Fields constitute a powerful tool for tackling the autonomous robot exploration problem, yet their applicability is limited by the heavy computational load involved in solving the Laplace equation in real time. In this letter, we propose a computationally efficient explor

Cited by 8SourceScholar