Alexander V. Hopp
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Alexander V. Hopp has a total of 143 co-authors. Here are the top co-authors by number of shared publications:
- Adrian Šošić
Technische Universität Darmstadt
2 shared publications - Marcel Müller
Mulliken Center for Theoretical Chemistry, Clausius-Institute for Physical and Theoretical Chemistry, University of Bonn, Beringstraße 4, Bonn, Germany, 53115
2 shared publications - Martin Fitzner
Department of Physics and Astronomy, University College London, London WC1E 6BT, United Kingdom
2 shared publications - Oliver Friedmann
Department of Informatics LMU Munich Germany
2 shared publications Yann Disser
2 shared publications- Yann Disser
TU Darmstadt
2 shared publications
Latest Publications
- Open Access
- 22 June 2025
- Published by American Chemical Society (ACS) in ChemRxiv
Bayesian Optimization Hackathon for Chemistry and Materials
The Acceleration Consortium and Merck KGaA hosted a 2-day virtual hackathon on March 27- 28, 2024, bringing together scientists to explore, collaborate, and innovate in the field of Bayesian optimization for the physical sciences. Participants were encouraged to select or develop Bayesian optimization algorithms, apply them to benchmarking tasks, design new benchmarks, create instructional tutorials, and describe real-world applications. With over 100 participants across 69 academic, industry, and government organizations located in 59 cities, 19 countries, and 4 continents, this was a global event. The outputs from this event, including developed algorithms, benchmarks, and tutorials, will serve as valuable resources for the research community, in addition to the new skills learned and connections formed. Released projects and general information are available at https://ac-bo-hackathon.github.io/ and other locations linked from individual project pages. This event demonstrates the potential of community-driven research efforts to accelerate advances in Bayesian optimization in chemistry and materials science.
- 22 June 2025
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessBayesian Optimization Hackathon for Chemistry and Materials
The Acceleration Consortium and Merck KGaA hosted a 2-day virtual hackathon on March 27- 28, 2024, bringing together scientists to explore, collaborate, and innovate in the field of Bayesian optimization for the physical sciences. Participants were encouraged to select or develop Bayesian optimization algorithms, apply them to benchmarking tasks, design new benchmarks, create instructional tutorials, and describe real-world applications. With over 100 participants across 69 academic, industry, and government organizations located in 59 cities, 19 countries, and 4 continents, this was a global event. The outputs from this event, including developed algorithms, benchmarks, and tutorials, will serve as valuable resources for the research community, in addition to the new skills learned and connections formed. Released projects and general information are available at https://ac-bo-hackathon.github.io/ and other locations linked from individual project pages. This event demonstrates the potential of community-driven research efforts to accelerate advances in Bayesian optimization in chemistry and materials science.
- Top Cited PapersOpen Access
- 6 May 2025
- Published by Royal Society of Chemistry (RSC) in Digital Discovery
- Vol. 4 (8) , 1991-2000
BayBE: a Bayesian Back End for experimental planning in the low-to-no-data regime
The Bayesian Back End (BayBE) has a range of advanced features enabling scientists to go beyond the basic Bayesian optimization loop and readily tackle real world experimental campaigns.
- 6 May 2025
- Published by Royal Society of Chemistry (RSC) in Digital Discovery
- Vol. 4 (8) , 1991-2000
Top Cited PapersOpen AccessBayBE: a Bayesian Back End for experimental planning in the low-to-no-data regime
The Bayesian Back End (BayBE) has a range of advanced features enabling scientists to go beyond the basic Bayesian optimization loop and readily tackle real world experimental campaigns.
- Open Access
- 26 September 2022
- Published by Oxford University Press (OUP) in Cerebral Cortex
- Vol. 33 (8) , 4574-4605
The fractal brain: scale-invariance in structure and dynamics
The past 40 years have witnessed extensive research on fractal structure and scale-free dynamics in the brain. Although considerable progress has been made, a comprehensive picture has yet to emerge, and needs further linking to a mechanistic account of brain function. Here, we review these concepts, connecting observations across different levels of organization, from both a structural and functional perspective. We argue that, paradoxically, the level of cortical circuits is the least understood from a structural point of view and perhaps the best studied from a dynamical one. We further link observations about scale-freeness and fractality with evidence that the environment provides constraints that may explain the usefulness of fractal structure and scale-free dynamics in the brain. Moreover, we discuss evidence that behavior exhibits scale-free properties, likely emerging from similarly organized brain dynamics, enabling an organism to thrive in an environment that shares the same organizational principles. Finally, we review the sparse evidence for and try to speculate on the functional consequences of fractality and scale-freeness for brain computation. These properties may endow the brain with computational capabilities that transcend current models of neural computation and could hold the key to unraveling how the brain constructs percepts and generates behavior.
- 26 September 2022
- Published by Oxford University Press (OUP) in Cerebral Cortex
- Vol. 33 (8) , 4574-4605
Open AccessThe fractal brain: scale-invariance in structure and dynamics
The past 40 years have witnessed extensive research on fractal structure and scale-free dynamics in the brain. Although considerable progress has been made, a comprehensive picture has yet to emerge, and needs further linking to a mechanistic account of brain function. Here, we review these concepts, connecting observations across different levels of organization, from both a structural and functional perspective. We argue that, paradoxically, the level of cortical circuits is the least understood from a structural point of view and perhaps the best studied from a dynamical one. We further link observations about scale-freeness and fractality with evidence that the environment provides constraints that may explain the usefulness of fractal structure and scale-free dynamics in the brain. Moreover, we discuss evidence that behavior exhibits scale-free properties, likely emerging from similarly organized brain dynamics, enabling an organism to thrive in an environment that shares the same organizational principles. Finally, we review the sparse evidence for and try to speculate on the functional consequences of fractality and scale-freeness for brain computation. These properties may endow the brain with computational capabilities that transcend current models of neural computation and could hold the key to unraveling how the brain constructs percepts and generates behavior.
- Open Access
- 19 July 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 199 (1-2) , 865-936
An exponential lower bound for Zadeh’s pivot rule
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, deterministic pivot rules are known to yield exponential running times, the random-facet rule was shown to have a subexponential running time. For a long time, Zadeh’s rule remained the most prominent candidate for the first deterministic pivot rule with subexponential running time. We present a lower bound construction that shows that Zadeh’s rule is in fact exponential in the worst case. Our construction is based on a close relation to the Strategy Improvement Algorithm for Parity Games and the Policy Iteration Algorithm for Markov Decision Processes, and we also obtain exponential lower bounds for Zadeh’s rule in these contexts.
- 19 July 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 199 (1-2) , 865-936
Open AccessAn exponential lower bound for Zadeh’s pivot rule
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, deterministic pivot rules are known to yield exponential running times, the random-facet rule was shown to have a subexponential running time. For a long time, Zadeh’s rule remained the most prominent candidate for the first deterministic pivot rule with subexponential running time. We present a lower bound construction that shows that Zadeh’s rule is in fact exponential in the worst case. Our construction is based on a close relation to the Strategy Improvement Algorithm for Parity Games and the Policy Iteration Algorithm for Markov Decision Processes, and we also obtain exponential lower bounds for Zadeh’s rule in these contexts.
- 1 May 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 868, 65-86
An improved lower bound for competitive graph exploration
- 1 May 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 868, 65-86
An improved lower bound for competitive graph exploration
- Open Access
An Exponential Lower Bound for Zadeh's pivot rule
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, deterministic pivot rules are known to yield exponential running times, the random-facet rule was shown to have a subexponential running time. For a long time, Zadeh's rule remained the most prominent candidate for the first deterministic pivot rule with subexponential running time. We present a lower bound construction that shows that Zadeh's rule is in fact exponential in the worst case. Our construction is based on a close relation to the Strategy Improvement Algorithm for Parity Games and the Policy Iteration Algorithm for Markov Decision Processes, and we also obtain exponential lower bounds for Zadeh's rule in these contexts.
Open AccessAn Exponential Lower Bound for Zadeh's pivot rule
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, deterministic pivot rules are known to yield exponential running times, the random-facet rule was shown to have a subexponential running time. For a long time, Zadeh's rule remained the most prominent candidate for the first deterministic pivot rule with subexponential running time. We present a lower bound construction that shows that Zadeh's rule is in fact exponential in the worst case. Our construction is based on a close relation to the Strategy Improvement Algorithm for Parity Games and the Policy Iteration Algorithm for Markov Decision Processes, and we also obtain exponential lower bounds for Zadeh's rule in these contexts.
- Open Access
- 13 April 2019
- Published by Springer Nature
- p. 168-180
On Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule
- 13 April 2019
- Published by Springer Nature
- p. 168-180
Open AccessOn Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule