From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “generalization bounds” 50

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

A generalization bound for a family of implicit networks
2026 Neurocomputing article Computer Science Neural Networks and Applications Open access

Samy Wu Fung, Benjamin Berkels

0

citations
Approximation and Generalization Capacities of Parametrized Quantum Circuits for Functions in Sobolev Spaces
2025 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

David Dechant, Jordi Tura, Vedran Dunjko

6

citations
Lower Bounds on Learning Pauli Channels With Individual Measurements
2025 IEEE Transactions on Information Theory article Computer Science Quantum Computing Algorithms and Architecture Open access

Omar Fawzi, Aadil Oufkir, Daniel Stilck França

5

citations
General Policies, Subgoal Structure, and Planning Width
2024 Journal of Artificial Intelligence Research article Computer Science AI-based Problem Solving and Planning Open access

Blai Bonet, Héctor Geffner

1

citations
Online knapsack with removal and recourse
2025 Journal of Computer and System Sciences article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

1

citations
Optimal rates of convergence for entropy regularization in discounted Markov decision processes
2026 Information and Inference A Journal of the IMA article Computer Science Reinforcement Learning in Robotics Open access

Semih Çaycı

0

citations
Characterizing the Age of Information With Multiple Coexisting Data Streams
2025 IEEE Transactions on Information Theory article Computer Science Age of Information Optimization Open access

Yoshiaki Inoue, Michel Mandjes

6

citations
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Online Node- and Edge-Deletion Problems with Advice
2021 Algorithmica article Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

7

citations
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2026 Journal of Automated Reasoning article Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

4

citations
Improved Results for Knapsack with Removal
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Valentin Hächler, Dennis Komm, Richard Královič

0

citations
Data variability in neural network Bayesian inference
2025 Physical Review Research article Computer Science Gaussian Processes and Bayesian Inference Open access

Michael Krämer

0

citations
Online Unbounded Knapsack
2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

2

citations
Application of convex hull analysis for the evaluation of data heterogeneity between patient populations of different origin and implications of hospital bias in downstream machine-learning-based data processing: A comparison of 4 critical-care patient datasets
2022 Frontiers in Big Data article Computer Science Machine Learning in Healthcare Open access

Konstantin Sharafutdinov, Jayesh Sudhir Bhat, Sebastian Johannes Fritsch, Kateryna Nikulina, Moein E. Samadi, Richard Polzin, +4 more

12

citations
On the advice complexity of the online dominating set problem
2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Sacha Krug

3

citations
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Kübra Hacı Güven, Moritz Stocker

0

citations
Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back
2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Joost-Pieter Katoen, Francesca Randone, Tobias Winkler

2

citations
A Deductive Verification Infrastructure for Probabilistic Programs
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

22

citations
Matroid bases with cardinality constraints on the intersection
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Britta Peis, Veerle Timmermans

9

citations
Weisfeiler-Leman Indistinguishability of Graphons
2021 RWTH Publications (RWTH Aachen) article Computer Science Advanced Graph Theory Research Open access

Jan Böker

0

citations
Frustration graph formalism for qudit observables
2026 Quantum Science and Technology article Computer Science Quantum Information and Cryptography Open access

Owidiusz Makuta, Błażej Kuzaka, Remigiusz Augusiak

0

citations
Continuity of Entropies via Integral Representations
2025 IEEE Transactions on Information Theory article Computer Science Quantum Information and Cryptography Open access

Mario Berta, Ludovico Lami, Marco Tomamichel

7

citations
Finite-valued Streaming String Transducers
2025 TheoretiCS article Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Anca Muscholl, Gabriele Puppis, Sarah Winter

2

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations