Aras Bacho

dblp:331/3565 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-2333-0884ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Theory of computation · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 What is a Polynomial-Time Computable Square-Integrable Function?
Aras Bacho, Svetlana Selivanova, Martin Ziegler 0001
CiE1
2026 Symbolic Recovery of Differential Equations: The Identifiability Problem
Philipp Scholl 0003, Aras Bacho, Holger Boche, Gitta Kutyniok
Mach. Learn.2
2025 Second-Order Parameterizations for the Complexity Theory of Integrable Functions
Aras Bacho, Martin Ziegler 0001
CASC1
2023 The Uniqueness Problem of Physical Law Learning
abstract
Physical law learning is the ambiguous attempt at automating the derivation of governing equations with the use of machine learning techniques. This paper shall serve as a first step to build a comprehensive theoretical framework for learning physical laws, aiming to provide reliability to according algorithms. One key problem consists in the fact that the governing equations might not be uniquely determined by the given data. We will study this problem in the common situation that a physical law is described by an ordinary or partial differential equation. For various different classes of differential equations, we provide both necessary and sufficient conditions for a function from a given function class to uniquely determine the differential equation which is governing the phenomenon. We then use our results to determine in extensive numerical experiments whether a function solves a differential equation uniquely.
Philipp Scholl 0003, Aras Bacho, Holger Boche, Gitta Kutyniok
ICASSP2
2023 A Fractional Graph Laplacian Approach to Oversmoothing
abstract
Graph neural networks (GNNs) have shown state-of-the-art performances in various applications. However, GNNs often struggle to capture long-range dependencies in graphs due to oversmoothing. In this paper, we generalize the concept of oversmoothing from undirected to directed graphs. To this aim, we extend the notion of Dirichlet energy by considering a directed symmetrically normalized Laplacian. As vanilla graph convolutional networks are prone to oversmooth, we adopt a neural graph ODE framework. Specifically, we propose fractional graph Laplacian neural ODEs, which describe non-local dynamics. We prove that our approach allows propagating information between distant nodes while maintaining a low probability of long-distance jumps. Moreover, we show that our method is more flexible with respect to the convergence of the graph’s Dirichlet energy, thereby mitigating oversmoothing. We conduct extensive experiments on synthetic and real-world graphs, both directed and undirected, demonstrating our method’s versatility across diverse graph homophily levels. Our code is available at https://github.com/RPaolino/fLode
Sohir Maskey, Raffaele Paolino, Aras Bacho, Gitta Kutyniok
NeurIPS3