Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Balázs Bánhelyi

dblp:77/3199 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-4408-9054ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
neural network verification
1.422025
No Soundness in the Real World: On the Challenges of the Verification of Deployed Neural Networks · ICML 2025
Fooling a Complete Neural Network Verifier · ICLR 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
Fooling a Complete Neural Network Verifier · ICLR 2021
Program verification
neural network verification
0.512021
Fooling a Complete Neural Network Verifier · ICLR 2021
Security and privacy of machine learning
adversarial attack
0.312025
No Soundness in the Real World: On the Challenges of the Verification of Deployed Neural Networks · ICML 2025

Methods — techniques the papers use, named apart from their topics

interval analysis · 1.7adversarial network · 1.7complete verification · 1.0adversarial examples · 0.5adversarial example · 0.5
YearPublicationVenuePosition
2025 No Soundness in the Real World: On the Challenges of the Verification of Deployed Neural Networks
abstract
The ultimate goal of verification is to guarantee the safety of deployed neural networks. Here, we claim that all the state-of-the-art verifiers we are aware of fail to reach this goal. Our key insight is that theoretical soundness (bounding the full-precision output while computing with floating point) does not imply practical soundness (bounding the floating point output in a potentially stochastic environment). We prove this observation for the approaches that are currently used to achieve provable theoretical soundness, such as interval analysis and its variants. We also argue that achieving practical soundness is significantly harder computationally. We support our claims empirically as well by evaluating several well-known verification methods. To mislead the verifiers, we create adversarial networks that detect and exploit features of the deployment environment, such as the order and precision of floating point operations. We demonstrate that all the tested verifiers are vulnerable to our new deployment-specific attacks, which proves that they are not practically sound.
Attila Szász, Balázs Bánhelyi, Márk Jelasity
ICML2
2021 Fooling a Complete Neural Network Verifier
Dániel Zombori, Balázs Bánhelyi, Tibor Csendes, István Megyeri, Márk Jelasity
ICLR2
2009 Distributed hyper-heuristics for real parameter optimization
abstract
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance than any of the original heuristics. While HHs lend themselves naturally for distributed deployment, relatively little attention has been paid so far on the design and evaluation of distributed HHs. To our knowledge, our work is the first to present a detailed evaluation and comparison of distributed HHs for real parameter optimization in an island model. Our set of test functions includes well-known benchmark functions and two realistic space-probe trajectory optimization problems. The set of algorithms available to the HHs include several variants of differential evolution, and uniform random search. Our main conclusion is that some of the simplest HHs are surprisingly successful in a distributed environment, and the best HHs we tested provide a robust and stable good performance over a wide range of scenarios and parameters.
Marco Biazzini, Balázs Bánhelyi, Alberto Montresor, Márk Jelasity
GECCO2
2006 A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems
Tibor Csendes, Barnabas M. Garay, Balázs Bánhelyi
J. Glob. Optim.3