[{"publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025","citation":{"ieee":"J. Rook and M. López-Ibáñez, “Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025</i>, 2025, pp. 1617–1642, doi: <a href=\"https://doi.org/10.1145/3712255.3716537\">10.1145/3712255.3716537</a>.","apa":"Rook, J., &#38; López-Ibáñez, M. (2025). Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches. In B. Filipic (Ed.), <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025</i> (pp. 1617–1642). ACM. <a href=\"https://doi.org/10.1145/3712255.3716537\">https://doi.org/10.1145/3712255.3716537</a>","short":"J. Rook, M. López-Ibáñez, in: B. Filipic (Ed.), Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025, ACM, 2025, pp. 1617–1642.","chicago":"Rook, Jeroen, and Manuel López-Ibáñez. “Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025</i>, edited by Bogdan Filipic, 1617–1642. ACM, 2025. <a href=\"https://doi.org/10.1145/3712255.3716537\">https://doi.org/10.1145/3712255.3716537</a>.","mla":"Rook, Jeroen, and Manuel López-Ibáñez. “Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025</i>, edited by Bogdan Filipic, ACM, 2025, pp. 1617–1642, doi:<a href=\"https://doi.org/10.1145/3712255.3716537\">10.1145/3712255.3716537</a>.","bibtex":"@inproceedings{Rook_López-Ibáñez_2025, title={Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches}, DOI={<a href=\"https://doi.org/10.1145/3712255.3716537\">10.1145/3712255.3716537</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025}, publisher={ACM}, author={Rook, Jeroen and López-Ibáñez, Manuel}, editor={Filipic, Bogdan}, year={2025}, pages={1617–1642} }","ama":"Rook J, López-Ibáñez M. Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches. In: Filipic B, ed. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025</i>. ACM; 2025:1617–1642. doi:<a href=\"https://doi.org/10.1145/3712255.3716537\">10.1145/3712255.3716537</a>"},"type":"conference","department":[{"_id":"819"}],"date_created":"2026-04-21T11:50:48Z","date_updated":"2026-04-21T11:51:59Z","year":"2025","title":"Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches","status":"public","author":[{"last_name":"Rook","first_name":"Jeroen","full_name":"Rook, Jeroen","id":"102977"},{"first_name":"Manuel","last_name":"López-Ibáñez","full_name":"López-Ibáñez, Manuel"}],"doi":"10.1145/3712255.3716537","user_id":"15504","editor":[{"first_name":"Bogdan","last_name":"Filipic","full_name":"Filipic, Bogdan"}],"page":"1617–1642","language":[{"iso":"eng"}],"_id":"65474","publisher":"ACM"},{"_id":"61778","language":[{"iso":"eng"}],"user_id":"71541","author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"},{"full_name":"Kamminga, Jonas","last_name":"Kamminga","first_name":"Jonas"}],"title":"On the complexity of estimating ground state entanglement and free  energy","year":"2025","status":"public","date_updated":"2026-04-30T14:08:44Z","date_created":"2025-10-10T13:45:28Z","external_id":{"arxiv":["2510.06796"]},"department":[{"_id":"7"},{"_id":"623"}],"type":"preprint","citation":{"apa":"Gharibian, S., &#38; Kamminga, J. (2025). On the complexity of estimating ground state entanglement and free  energy. In <i>arXiv:2510.06796</i>.","ieee":"S. Gharibian and J. Kamminga, “On the complexity of estimating ground state entanglement and free  energy,” <i>arXiv:2510.06796</i>. 2025.","short":"S. Gharibian, J. Kamminga, ArXiv:2510.06796 (2025).","chicago":"Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” <i>ArXiv:2510.06796</i>, 2025.","mla":"Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” <i>ArXiv:2510.06796</i>, 2025.","ama":"Gharibian S, Kamminga J. On the complexity of estimating ground state entanglement and free  energy. <i>arXiv:251006796</i>. Published online 2025.","bibtex":"@article{Gharibian_Kamminga_2025, title={On the complexity of estimating ground state entanglement and free  energy}, journal={arXiv:2510.06796}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2025} }"},"publication":"arXiv:2510.06796","abstract":[{"text":"Understanding the entanglement structure of local Hamiltonian ground spaces\r\nis a physically motivated problem, with applications ranging from tensor\r\nnetwork design to quantum error-correcting codes. To this end, we study the\r\ncomplexity of estimating ground state entanglement, and more generally entropy\r\nestimation for low energy states and Gibbs states. We find, in particular, that\r\nthe classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum\r\nanalogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a\r\ncrucial role for such problems, showing: (1) Detecting a high-entanglement\r\nground state is qq-QAM-complete, (2) computing an additive error approximation\r\nto the Helmholtz free energy (equivalently, a multiplicative error\r\napproximation to the partition function) is in qq-QAM, (3) detecting a\r\nlow-entanglement ground state is QMA(2)-hard, and (4) detecting low energy\r\nstates which are close to product states can range from QMA-complete to\r\nQMA(2)-complete. Our results make progress on an open question of [Bravyi,\r\nChowdhury, Gosset and Wocjan, Nature Physics 2022] on free energy, and yield\r\nthe first QMA(2)-complete Hamiltonian problem using local Hamiltonians (cf. the\r\nsparse QMA(2)-complete Hamiltonian problem of [Chailloux, Sattath, CCC 2012]).","lang":"eng"}]},{"doi":"10.1145/3728179.3728187","user_id":"16153","main_file_link":[{"open_access":"1"}],"publisher":"ACM","_id":"65618","language":[{"iso":"eng"}],"date_updated":"2026-05-13T09:45:17Z","publication_status":"published","status":"public","title":"Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations","year":"2025","author":[{"first_name":"Mika","last_name":"Bröker","full_name":"Bröker, Mika"},{"last_name":"Menzel","first_name":"Johannes","full_name":"Menzel, Johannes"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"}],"type":"conference","oa":"1","department":[{"_id":"27"},{"_id":"518"}],"date_created":"2026-05-13T09:44:21Z","publication":"Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","citation":{"short":"M. Bröker, J. Menzel, C. Plessl, in: Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, ACM, 2025.","chicago":"Bröker, Mika, Johannes Menzel, and Christian Plessl. “Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations.” In <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. ACM, 2025. <a href=\"https://doi.org/10.1145/3728179.3728187\">https://doi.org/10.1145/3728179.3728187</a>.","ieee":"M. Bröker, J. Menzel, and C. Plessl, “Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations,” 2025, doi: <a href=\"https://doi.org/10.1145/3728179.3728187\">10.1145/3728179.3728187</a>.","apa":"Bröker, M., Menzel, J., &#38; Plessl, C. (2025). Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations. <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. <a href=\"https://doi.org/10.1145/3728179.3728187\">https://doi.org/10.1145/3728179.3728187</a>","bibtex":"@inproceedings{Bröker_Menzel_Plessl_2025, title={Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations}, DOI={<a href=\"https://doi.org/10.1145/3728179.3728187\">10.1145/3728179.3728187</a>}, booktitle={Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}, publisher={ACM}, author={Bröker, Mika and Menzel, Johannes and Plessl, Christian}, year={2025} }","ama":"Bröker M, Menzel J, Plessl C. Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations. In: <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3728179.3728187\">10.1145/3728179.3728187</a>","mla":"Bröker, Mika, et al. “Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations.” <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3728179.3728187\">10.1145/3728179.3728187</a>."}},{"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ITCS.2025.85","author":[{"id":"57863","full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"},{"full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","id":"71541"},{"full_name":"Nagaj, Daniel","last_name":"Nagaj","first_name":"Daniel"}],"title":"Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation","year":"2025","intvolume":"       325","date_updated":"2026-05-15T08:38:31Z","publication_status":"published","date_created":"2024-01-07T20:09:13Z","department":[{"_id":"7"},{"_id":"623"}],"type":"conference","issue":"85","publication":"16th Innovations in Theoretical Computer Science (ITCS)","abstract":[{"lang":"eng","text":"Despite the fundamental role the Quantum Satisfiability (QSAT) problem has\r\nplayed in quantum complexity theory, a central question remains open: At which\r\nlocal dimension does the complexity of QSAT transition from \"easy\" to \"hard\"?\r\nHere, we study QSAT with each constraint acting on a $k$-dimensional and\r\n$l$-dimensional qudit pair, denoted $(k,l)$-QSAT. Our first main result shows\r\nthat, surprisingly, QSAT on qubits can remain $\\mathsf{QMA}_1$-hard, in that\r\n$(2,5)$-QSAT is $\\mathsf{QMA}_1$-complete. In contrast, $2$-SAT on qubits is\r\nwell-known to be poly-time solvable [Bravyi, 2006]. Our second main result\r\nproves that $(3,d)$-QSAT on the 1D line with $d\\in O(1)$ is also\r\n$\\mathsf{QMA}_1$-hard. Finally, we initiate the study of 1D $(2,d)$-QSAT by\r\ngiving a frustration-free 1D Hamiltonian with a unique, entangled ground state.\r\n  Our first result uses a direct embedding, combining a novel clock\r\nconstruction with the 2D circuit-to-Hamiltonian construction of [Gosset, Nagaj,\r\n2013]. Of note is a new simplified and analytic proof for the latter (as\r\nopposed to a partially numeric proof in [GN13]). This exploits Unitary Labelled\r\nGraphs [Bausch, Cubitt, Ozols, 2017] together with a new \"Nullspace Connection\r\nLemma\", allowing us to break low energy analyses into small patches of\r\nprojectors, and to improve the soundness analysis of [GN13] from\r\n$\\Omega(1/T^6)$ to $\\Omega(1/T^2)$, for $T$ the number of gates. Our second\r\nresult goes via black-box reduction: Given an arbitrary 1D Hamiltonian $H$ on\r\n$d'$-dimensional qudits, we show how to embed it into an effective null-space\r\nof a 1D $(3,d)$-QSAT instance, for $d\\in O(1)$. Our approach may be viewed as a\r\nweaker notion of \"simulation\" (\\`a la [Bravyi, Hastings 2017], [Cubitt,\r\nMontanaro, Piddock 2018]). As far as we are aware, this gives the first\r\n\"black-box simulation\"-based $\\mathsf{QMA}_1$-hardness result, i.e. for\r\nfrustration-free Hamiltonians."}],"_id":"50272","page":"1-24","volume":325,"user_id":"71541","status":"public","external_id":{"arxiv":["2401.02368"]},"citation":{"ieee":"D. Rudolph, S. Gharibian, and D. Nagaj, “Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation,” in <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, 2025, vol. 325, no. 85, pp. 1–24, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>.","apa":"Rudolph, D., Gharibian, S., &#38; Nagaj, D. (2025). Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, <i>325</i>(85), 1–24. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">https://doi.org/10.4230/LIPIcs.ITCS.2025.85</a>","short":"D. Rudolph, S. Gharibian, D. Nagaj, in: 16th Innovations in Theoretical Computer Science (ITCS), 2025, pp. 1–24.","chicago":"Rudolph, Dorian, Sevag Gharibian, and Daniel Nagaj. “Quantum 2-SAT on Low Dimensional Systems Is $\\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” In <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, 325:1–24, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">https://doi.org/10.4230/LIPIcs.ITCS.2025.85</a>.","mla":"Rudolph, Dorian, et al. “Quantum 2-SAT on Low Dimensional Systems Is $\\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, vol. 325, no. 85, 2025, pp. 1–24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>.","bibtex":"@inproceedings{Rudolph_Gharibian_Nagaj_2025, title={Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation}, volume={325}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>}, number={85}, booktitle={16th Innovations in Theoretical Computer Science (ITCS)}, author={Rudolph, Dorian and Gharibian, Sevag and Nagaj, Daniel}, year={2025}, pages={1–24} }","ama":"Rudolph D, Gharibian S, Nagaj D. Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. In: <i>16th Innovations in Theoretical Computer Science (ITCS)</i>. Vol 325. ; 2025:1-24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>"}},{"abstract":[{"text":"Estimating ground state energies of many-body Hamiltonians is a central task\r\nin many areas of quantum physics. In this work, we give quantum algorithms\r\nwhich, given any $k$-body Hamiltonian $H$, compute an estimate for the ground\r\nstate energy and prepare a quantum state achieving said energy, respectively.\r\nSpecifically, for any $\\varepsilon>0$, our algorithms return, with high\r\nprobability, an estimate of the ground state energy of $H$ within additive\r\nerror $\\varepsilon M$, or a quantum state with the corresponding energy. Here,\r\n$M$ is the total strength of all interaction terms, which in general is\r\nextensive in the system size. Our approach makes no assumptions about the\r\ngeometry or spatial locality of interaction terms of the input Hamiltonian and\r\nthus handles even long-range or all-to-all interactions, such as in quantum\r\nchemistry, where lattice-based techniques break down. In this fully general\r\nsetting, the runtime of our algorithms scales as $2^{cn/2}$ for $c<1$, yielding\r\nthe first quantum algorithms for low-energy estimation breaking the natural\r\nbound based on Grover search. The core of our approach is remarkably simple,\r\nand relies on showing that any $k$-body Hamiltonian has a low-energy subspace\r\nof exponential dimension.","lang":"eng"}],"publication":"Physical Review Letters","citation":{"bibtex":"@article{Buhrman_Gharibian_Landau_Gall_Schuch_Tamaki_2025, title={Beating Grover search for low-energy estimation and state preparation}, volume={135}, DOI={<a href=\"https://doi.org/10.1103/29qw-bssx\">10.1103/29qw-bssx</a>}, journal={Physical Review Letters}, author={Buhrman, Harry and Gharibian, Sevag and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru}, year={2025}, pages={030601} }","ama":"Buhrman H, Gharibian S, Landau Z, Gall FL, Schuch N, Tamaki S. Beating Grover search for low-energy estimation and state preparation. <i>Physical Review Letters</i>. 2025;135:030601. doi:<a href=\"https://doi.org/10.1103/29qw-bssx\">10.1103/29qw-bssx</a>","mla":"Buhrman, Harry, et al. “Beating Grover Search for Low-Energy Estimation and State Preparation.” <i>Physical Review Letters</i>, vol. 135, 2025, p. 030601, doi:<a href=\"https://doi.org/10.1103/29qw-bssx\">10.1103/29qw-bssx</a>.","short":"H. Buhrman, S. Gharibian, Z. Landau, F.L. Gall, N. Schuch, S. Tamaki, Physical Review Letters 135 (2025) 030601.","chicago":"Buhrman, Harry, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, and Suguru Tamaki. “Beating Grover Search for Low-Energy Estimation and State Preparation.” <i>Physical Review Letters</i> 135 (2025): 030601. <a href=\"https://doi.org/10.1103/29qw-bssx\">https://doi.org/10.1103/29qw-bssx</a>.","ieee":"H. Buhrman, S. Gharibian, Z. Landau, F. L. Gall, N. Schuch, and S. Tamaki, “Beating Grover search for low-energy estimation and state preparation,” <i>Physical Review Letters</i>, vol. 135, p. 030601, 2025, doi: <a href=\"https://doi.org/10.1103/29qw-bssx\">10.1103/29qw-bssx</a>.","apa":"Buhrman, H., Gharibian, S., Landau, Z., Gall, F. L., Schuch, N., &#38; Tamaki, S. (2025). Beating Grover search for low-energy estimation and state preparation. <i>Physical Review Letters</i>, <i>135</i>, 030601. <a href=\"https://doi.org/10.1103/29qw-bssx\">https://doi.org/10.1103/29qw-bssx</a>"},"type":"journal_article","department":[{"_id":"7"},{"_id":"623"}],"external_id":{"arxiv":["2407.03073"]},"date_created":"2024-07-04T09:02:42Z","date_updated":"2026-05-15T08:40:45Z","publication_status":"published","intvolume":"       135","title":"Beating Grover search for low-energy estimation and state preparation","status":"public","year":"2025","author":[{"full_name":"Buhrman, Harry","first_name":"Harry","last_name":"Buhrman"},{"full_name":"Gharibian, Sevag","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541"},{"full_name":"Landau, Zeph","last_name":"Landau","first_name":"Zeph"},{"full_name":"Gall, François Le","first_name":"François Le","last_name":"Gall"},{"full_name":"Schuch, Norbert","first_name":"Norbert","last_name":"Schuch"},{"full_name":"Tamaki, Suguru","last_name":"Tamaki","first_name":"Suguru"}],"doi":"10.1103/29qw-bssx","user_id":"71541","volume":135,"page":"030601","language":[{"iso":"eng"}],"_id":"55037"},{"title":"Energy, Bosons and Computational Complexity","status":"public","year":"2025","author":[{"full_name":"Chabaud, Ulysse","last_name":"Chabaud","first_name":"Ulysse"},{"id":"71541","full_name":"Gharibian, Sevag","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379"},{"full_name":"Mehraban, Saeed","first_name":"Saeed","last_name":"Mehraban"},{"full_name":"Motamedi, Arsalan","first_name":"Arsalan","last_name":"Motamedi"},{"last_name":"Naeij","first_name":"Hamid Reza","full_name":"Naeij, Hamid Reza"},{"first_name":"Dorian","last_name":"Rudolph","full_name":"Rudolph, Dorian","id":"57863"},{"full_name":"Sambrani, Dhruva","first_name":"Dhruva","last_name":"Sambrani"}],"date_updated":"2026-05-15T08:39:50Z","_id":"61776","language":[{"iso":"eng"}],"user_id":"71541","publication":"arXiv:2510.08545","citation":{"bibtex":"@article{Chabaud_Gharibian_Mehraban_Motamedi_Naeij_Rudolph_Sambrani_2025, title={Energy, Bosons and Computational Complexity}, journal={arXiv:2510.08545}, author={Chabaud, Ulysse and Gharibian, Sevag and Mehraban, Saeed and Motamedi, Arsalan and Naeij, Hamid Reza and Rudolph, Dorian and Sambrani, Dhruva}, year={2025} }","ama":"Chabaud U, Gharibian S, Mehraban S, et al. Energy, Bosons and Computational Complexity. <i>arXiv:251008545</i>. Published online 2025.","mla":"Chabaud, Ulysse, et al. “Energy, Bosons and Computational Complexity.” <i>ArXiv:2510.08545</i>, 2025.","short":"U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H.R. Naeij, D. Rudolph, D. Sambrani, ArXiv:2510.08545 (2025).","chicago":"Chabaud, Ulysse, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, and Dhruva Sambrani. “Energy, Bosons and Computational Complexity.” <i>ArXiv:2510.08545</i>, 2025.","ieee":"U. Chabaud <i>et al.</i>, “Energy, Bosons and Computational Complexity,” <i>arXiv:2510.08545</i>. 2025.","apa":"Chabaud, U., Gharibian, S., Mehraban, S., Motamedi, A., Naeij, H. R., Rudolph, D., &#38; Sambrani, D. (2025). Energy, Bosons and Computational Complexity. In <i>arXiv:2510.08545</i>."},"abstract":[{"lang":"eng","text":"We investigate the role of energy, i.e. average photon number, as a resource\r\nin the computational complexity of bosonic systems. We show three sets of\r\nresults: (1. Energy growth rates) There exist bosonic gate sets which increase\r\nenergy incredibly rapidly, obtaining e.g. infinite energy in finite/constant\r\ntime. We prove these high energies can make computing properties of bosonic\r\ncomputations, such as deciding whether a given computation will attain infinite\r\nenergy, extremely difficult, formally undecidable. (2. Lower bounds on\r\ncomputational power) More energy ``='' more computational power. For example,\r\ncertain gate sets allow poly-time bosonic computations to simulate PTOWER, the\r\nset of deterministic computations whose runtime scales as a tower of\r\nexponentials with polynomial height. Even just exponential energy and $O(1)$\r\nmodes suffice to simulate NP, which, importantly, is a setup similar to that of\r\nthe recent bosonic factoring algorithm of [Brenner, Caha, Coiteux-Roy and\r\nKoenig (2024)]. For simpler gate sets, we show an energy hierarchy theorem. (3.\r\nUpper bounds on computational power) Bosonic computations with polynomial\r\nenergy can be simulated in BQP, ``physical'' bosonic computations with\r\narbitrary finite energy are decidable, and the gate set consisting of Gaussian\r\ngates and the cubic phase gate can be simulated in PP, with exponential bound\r\non energy, improving upon the previous PSPACE upper bound. Finally, combining\r\nupper and lower bounds yields no-go theorems for a continuous-variable\r\nSolovay--Kitaev theorem for gate sets such as the Gaussian and cubic phase\r\ngates."}],"external_id":{"arxiv":["2510.08545"]},"date_created":"2025-10-10T13:44:52Z","type":"preprint","department":[{"_id":"7"},{"_id":"623"}]},{"citation":{"short":"S.-L. Kremer, D. Rudolph, S. Gharibian, ArXiv:2506.17066 (2025).","chicago":"Kremer, Simon-Luca, Dorian Rudolph, and Sevag Gharibian. “Quantum K-SAT Related Hypergraph Problems.” <i>ArXiv:2506.17066</i>, 2025.","ieee":"S.-L. Kremer, D. Rudolph, and S. Gharibian, “Quantum k-SAT Related Hypergraph Problems,” <i>arXiv:2506.17066</i>. 2025.","apa":"Kremer, S.-L., Rudolph, D., &#38; Gharibian, S. (2025). Quantum k-SAT Related Hypergraph Problems. In <i>arXiv:2506.17066</i>.","bibtex":"@article{Kremer_Rudolph_Gharibian_2025, title={Quantum k-SAT Related Hypergraph Problems}, journal={arXiv:2506.17066}, author={Kremer, Simon-Luca and Rudolph, Dorian and Gharibian, Sevag}, year={2025} }","ama":"Kremer S-L, Rudolph D, Gharibian S. Quantum k-SAT Related Hypergraph Problems. <i>arXiv:250617066</i>. Published online 2025.","mla":"Kremer, Simon-Luca, et al. “Quantum K-SAT Related Hypergraph Problems.” <i>ArXiv:2506.17066</i>, 2025."},"publication":"arXiv:2506.17066","abstract":[{"lang":"eng","text":"The Quantum k-SAT problem is the quantum generalization of the k-SAT problem.\r\nIt is the problem whether a given local Hamiltonian is frustration-free.\r\nFrustration-free means that the ground state of the k-local Hamiltonian\r\nminimizes the energy of every local interaction term simultaneously. This is a\r\ncentral question in quantum physics and a canonical QMA_1-complete problem. The\r\nQuantum k-SAT problem is not as well studied as the classical k-SAT problem in\r\nterms of special tractable cases, approximation algorithms and parameterized\r\ncomplexity. In this paper, we will give a graph-theoretic study of the Quantum\r\nk-SAT problem with the structures core and radius. These hypergraph structures\r\nare important to solve the Quantum k-SAT problem. We can solve a Quantum k-SAT\r\ninstance in polynomial time if the derived hypergraph has a core of size n-m+a,\r\nwhere a is a constant, and the radius is at most logarithmic. If it exists, we\r\ncan find a core of size n-m+a with the best possible radius in polynomial time,\r\nwhereas finding a general minimum core with minimal radius is NP-hard."}],"date_created":"2025-06-27T06:56:35Z","external_id":{"arxiv":["2506.17066"]},"department":[{"_id":"7"},{"_id":"623"}],"type":"preprint","author":[{"first_name":"Simon-Luca","last_name":"Kremer","full_name":"Kremer, Simon-Luca"},{"id":"57863","last_name":"Rudolph","first_name":"Dorian","full_name":"Rudolph, Dorian"},{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"}],"year":"2025","title":"Quantum k-SAT Related Hypergraph Problems","status":"public","date_updated":"2026-05-15T08:41:01Z","_id":"60432","language":[{"iso":"eng"}],"user_id":"71541"},{"doi":"10.1145/3737897.3767294","user_id":"44169","language":[{"iso":"eng"}],"_id":"61256","date_updated":"2026-05-20T08:46:32Z","conference":{"end_date":"2025-11-08","location":"Hong Kong, China","start_date":"2025-11-04","name":"ACM Workshop on Mobility in the Evolving Internet Architecture (MobiArch), co-located with ACM MobiCom"},"author":[{"id":"44169","full_name":"Illian, Marvin","first_name":"Marvin","last_name":"Illian","orcid":"0009-0007-2992-8346"},{"last_name":"Luchterhandt","first_name":"Björn","full_name":"Luchterhandt, Björn"},{"id":"102868","full_name":"Wang, Lin","last_name":"Wang","first_name":"Lin","orcid":"0000-0001-7181-6128"}],"status":"public","title":"Band Switching for Mobile Energy Optimization in 5G Networks and Beyond","year":"2025","department":[{"_id":"34"},{"_id":"7"},{"_id":"75"}],"type":"conference","date_created":"2025-09-12T11:22:18Z","quality_controlled":"1","citation":{"chicago":"Illian, Marvin, Björn Luchterhandt, and Lin Wang. “Band Switching for Mobile Energy Optimization in 5G Networks and Beyond.” In <i>Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)</i>, 2025. <a href=\"https://doi.org/10.1145/3737897.3767294\">https://doi.org/10.1145/3737897.3767294</a>.","short":"M. Illian, B. Luchterhandt, L. Wang, in: Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch), 2025.","apa":"Illian, M., Luchterhandt, B., &#38; Wang, L. (2025). Band Switching for Mobile Energy Optimization in 5G Networks and Beyond. <i>Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)</i>. ACM Workshop on Mobility in the Evolving Internet Architecture (MobiArch), co-located with ACM MobiCom, Hong Kong, China. <a href=\"https://doi.org/10.1145/3737897.3767294\">https://doi.org/10.1145/3737897.3767294</a>","ieee":"M. Illian, B. Luchterhandt, and L. Wang, “Band Switching for Mobile Energy Optimization in 5G Networks and Beyond,” presented at the ACM Workshop on Mobility in the Evolving Internet Architecture (MobiArch), co-located with ACM MobiCom, Hong Kong, China, 2025, doi: <a href=\"https://doi.org/10.1145/3737897.3767294\">10.1145/3737897.3767294</a>.","ama":"Illian M, Luchterhandt B, Wang L. Band Switching for Mobile Energy Optimization in 5G Networks and Beyond. In: <i>Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)</i>. ; 2025. doi:<a href=\"https://doi.org/10.1145/3737897.3767294\">10.1145/3737897.3767294</a>","bibtex":"@inproceedings{Illian_Luchterhandt_Wang_2025, title={Band Switching for Mobile Energy Optimization in 5G Networks and Beyond}, DOI={<a href=\"https://doi.org/10.1145/3737897.3767294\">10.1145/3737897.3767294</a>}, booktitle={Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)}, author={Illian, Marvin and Luchterhandt, Björn and Wang, Lin}, year={2025} }","mla":"Illian, Marvin, et al. “Band Switching for Mobile Energy Optimization in 5G Networks and Beyond.” <i>Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)</i>, 2025, doi:<a href=\"https://doi.org/10.1145/3737897.3767294\">10.1145/3737897.3767294</a>."},"publication":"Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)"},{"date_created":"2026-05-29T14:12:43Z","department":[{"_id":"574"}],"oa":"1","type":"conference","citation":{"ieee":"L. M. Kamdem Teyou <i>et al.</i>, “Neural Reasoning for Robust Instance Retrieval in SHOIQ,” presented at the The 13th COnference on Knowledge Capture (K-CAP’25), Dayton-USA, 2025, doi: <a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>.","apa":"Kamdem Teyou, L. M., Friedrichs, L., Kouagou, N. J., Demir, C., Mahmood, Y., Heindorf, S., &#38; Ngonga Ngomo, A.-C. (2025). <i>Neural Reasoning for Robust Instance Retrieval in SHOIQ</i>. The 13th COnference on Knowledge Capture (K-CAP’25), Dayton-USA. <a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>","chicago":"Kamdem Teyou, Louis Mozart, Luke Friedrichs, N’Dah Jean Kouagou, Caglar Demir, Yasir Mahmood, Stefan Heindorf, and Axel-Cyrille Ngonga Ngomo. “Neural Reasoning for Robust Instance Retrieval in SHOIQ,” 2025. <a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>.","short":"L.M. Kamdem Teyou, L. Friedrichs, N.J. Kouagou, C. Demir, Y. Mahmood, S. Heindorf, A.-C. Ngonga Ngomo, in: 2025.","mla":"Kamdem Teyou, Louis Mozart, et al. <i>Neural Reasoning for Robust Instance Retrieval in SHOIQ</i>. 2025, doi:<a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>.","bibtex":"@inproceedings{Kamdem Teyou_Friedrichs_Kouagou_Demir_Mahmood_Heindorf_Ngonga Ngomo_2025, title={Neural Reasoning for Robust Instance Retrieval in SHOIQ}, DOI={<a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>}, author={Kamdem Teyou, Louis Mozart and Friedrichs, Luke and Kouagou, N’Dah Jean and Demir, Caglar and Mahmood, Yasir and Heindorf, Stefan and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","ama":"Kamdem Teyou LM, Friedrichs L, Kouagou NJ, et al. Neural Reasoning for Robust Instance Retrieval in SHOIQ. In: ; 2025. doi:<a href=\"https://doi.org/10.1145/3731443.377134\">https://doi.org/10.1145/3731443.377134</a>"},"_id":"65734","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3731443.3771348","open_access":"1"}],"user_id":"101165","doi":"https://doi.org/10.1145/3731443.377134","author":[{"id":"101165","full_name":"Kamdem Teyou, Louis Mozart","last_name":"Kamdem Teyou","first_name":"Louis Mozart"},{"last_name":"Friedrichs","first_name":"Luke","full_name":"Friedrichs, Luke"},{"last_name":"Kouagou","first_name":"N'Dah Jean","full_name":"Kouagou, N'Dah Jean","id":"87189"},{"id":"43817","full_name":"Demir, Caglar","first_name":"Caglar","last_name":"Demir"},{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir","id":"99353"},{"id":"11871","first_name":"Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","full_name":"Heindorf, Stefan"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo"}],"conference":{"location":"Dayton-USA","start_date":"2025-12-09","name":"The 13th COnference on Knowledge Capture (K-CAP'25)","end_date":"2025-12-12"},"status":"public","year":"2025","title":"Neural Reasoning for Robust Instance Retrieval in SHOIQ","date_updated":"2026-05-29T14:16:06Z"},{"volume":135,"user_id":"15782","doi":"10.1016/j.procir.2025.01.084","_id":"61986","publisher":"Elsevier BV","language":[{"iso":"eng"}],"page":"972-977","intvolume":"       135","publication_status":"published","date_updated":"2026-06-12T10:03:46Z","publication_identifier":{"issn":["2212-8271"]},"author":[{"full_name":"Rasor, Anja","first_name":"Anja","last_name":"Rasor","id":"34415"},{"first_name":"Julia Marie","last_name":"Vehmeyer","full_name":"Vehmeyer, Julia Marie","id":"84394"},{"first_name":"Lisa","last_name":"Kirchberg","full_name":"Kirchberg, Lisa"},{"full_name":"Scholtysik, Michel","last_name":"Scholtysik","first_name":"Michel"},{"full_name":"Koldewey, Christian","orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian","last_name":"Koldewey","id":"43136"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"}],"year":"2025","title":"Key performance indicator system for evaluating the circular economy along the value chain","status":"public","department":[{"_id":"563"}],"type":"conference","date_created":"2025-10-24T08:01:13Z","citation":{"ieee":"A. Rasor, J. M. Vehmeyer, L. Kirchberg, M. Scholtysik, C. Koldewey, and R. Dumitrescu, “Key performance indicator system for evaluating the circular economy along the value chain,” in <i>Procedia CIRP</i>, 2025, vol. 135, pp. 972–977, doi: <a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">10.1016/j.procir.2025.01.084</a>.","apa":"Rasor, A., Vehmeyer, J. M., Kirchberg, L., Scholtysik, M., Koldewey, C., &#38; Dumitrescu, R. (2025). Key performance indicator system for evaluating the circular economy along the value chain. <i>Procedia CIRP</i>, <i>135</i>, 972–977. <a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">https://doi.org/10.1016/j.procir.2025.01.084</a>","chicago":"Rasor, Anja, Julia Marie Vehmeyer, Lisa Kirchberg, Michel Scholtysik, Christian Koldewey, and Roman Dumitrescu. “Key Performance Indicator System for Evaluating the Circular Economy along the Value Chain.” In <i>Procedia CIRP</i>, 135:972–77. Elsevier BV, 2025. <a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">https://doi.org/10.1016/j.procir.2025.01.084</a>.","short":"A. Rasor, J.M. Vehmeyer, L. Kirchberg, M. Scholtysik, C. Koldewey, R. Dumitrescu, in: Procedia CIRP, Elsevier BV, 2025, pp. 972–977.","mla":"Rasor, Anja, et al. “Key Performance Indicator System for Evaluating the Circular Economy along the Value Chain.” <i>Procedia CIRP</i>, vol. 135, Elsevier BV, 2025, pp. 972–77, doi:<a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">10.1016/j.procir.2025.01.084</a>.","bibtex":"@inproceedings{Rasor_Vehmeyer_Kirchberg_Scholtysik_Koldewey_Dumitrescu_2025, title={Key performance indicator system for evaluating the circular economy along the value chain}, volume={135}, DOI={<a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">10.1016/j.procir.2025.01.084</a>}, booktitle={Procedia CIRP}, publisher={Elsevier BV}, author={Rasor, Anja and Vehmeyer, Julia Marie and Kirchberg, Lisa and Scholtysik, Michel and Koldewey, Christian and Dumitrescu, Roman}, year={2025}, pages={972–977} }","ama":"Rasor A, Vehmeyer JM, Kirchberg L, Scholtysik M, Koldewey C, Dumitrescu R. Key performance indicator system for evaluating the circular economy along the value chain. In: <i>Procedia CIRP</i>. Vol 135. Elsevier BV; 2025:972-977. doi:<a href=\"https://doi.org/10.1016/j.procir.2025.01.084\">10.1016/j.procir.2025.01.084</a>"},"publication":"Procedia CIRP"},{"publication":"2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)","citation":{"bibtex":"@inproceedings{Koldewey_Rohde_Strobel_Vehmeyer_Fichtler_Dumitrescu_2025, title={Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems}, DOI={<a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">10.1109/ice/itmc65658.2025.11106522</a>}, booktitle={2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)}, publisher={IEEE}, author={Koldewey, Christian and Rohde, Malte Nick and Strobel, Gero and Vehmeyer, Julia Marie and Fichtler, Timm and Dumitrescu, Roman}, year={2025} }","ama":"Koldewey C, Rohde MN, Strobel G, Vehmeyer JM, Fichtler T, Dumitrescu R. Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems. In: <i>2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">10.1109/ice/itmc65658.2025.11106522</a>","mla":"Koldewey, Christian, et al. “Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems.” <i>2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">10.1109/ice/itmc65658.2025.11106522</a>.","chicago":"Koldewey, Christian, Malte Nick Rohde, Gero Strobel, Julia Marie Vehmeyer, Timm Fichtler, and Roman Dumitrescu. “Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems.” In <i>2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">https://doi.org/10.1109/ice/itmc65658.2025.11106522</a>.","short":"C. Koldewey, M.N. Rohde, G. Strobel, J.M. Vehmeyer, T. Fichtler, R. Dumitrescu, in: 2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC), IEEE, 2025.","ieee":"C. Koldewey, M. N. Rohde, G. Strobel, J. M. Vehmeyer, T. Fichtler, and R. Dumitrescu, “Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems,” 2025, doi: <a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">10.1109/ice/itmc65658.2025.11106522</a>.","apa":"Koldewey, C., Rohde, M. N., Strobel, G., Vehmeyer, J. M., Fichtler, T., &#38; Dumitrescu, R. (2025). Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems. <i>2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)</i>. <a href=\"https://doi.org/10.1109/ice/itmc65658.2025.11106522\">https://doi.org/10.1109/ice/itmc65658.2025.11106522</a>"},"date_created":"2025-10-24T06:31:07Z","type":"conference","department":[{"_id":"563"}],"year":"2025","status":"public","title":"Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems","author":[{"full_name":"Koldewey, Christian","last_name":"Koldewey","first_name":"Christian","orcid":"https://orcid.org/0000-0001-7992-6399","id":"43136"},{"full_name":"Rohde, Malte Nick","last_name":"Rohde","first_name":"Malte Nick"},{"full_name":"Strobel, Gero","first_name":"Gero","last_name":"Strobel"},{"id":"84394","first_name":"Julia Marie","last_name":"Vehmeyer","full_name":"Vehmeyer, Julia Marie"},{"id":"66731","last_name":"Fichtler","first_name":"Timm","orcid":"https://orcid.org/0000-0001-6034-4399","full_name":"Fichtler, Timm"},{"full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman","id":"16190"}],"publication_status":"published","date_updated":"2026-06-12T10:03:59Z","publisher":"IEEE","_id":"61955","language":[{"iso":"eng"}],"user_id":"15782","doi":"10.1109/ice/itmc65658.2025.11106522"},{"status":"public","year":"2025","title":"Out of Order: On the Importance of Word Positions in Explaining Text Classification","author":[{"full_name":"Lütke Stockdiek, Janina","first_name":"Janina","last_name":"Lütke Stockdiek"},{"full_name":"Grimme, Britta","last_name":"Grimme","first_name":"Britta","id":"103682"},{"full_name":"Griesbach, Marie","first_name":"Marie","last_name":"Griesbach"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"}],"date_updated":"2026-07-01T12:33:09Z","page":"432–447","language":[{"iso":"eng"}],"_id":"66098","user_id":"15504","publication":"International Artificial Intelligence Symposium","citation":{"ama":"Lütke Stockdiek J, Grimme B, Griesbach M, Grimme C. Out of Order: On the Importance of Word Positions in Explaining Text Classification. In: <i>International Artificial Intelligence Symposium</i>. ; 2025:432–447.","bibtex":"@inproceedings{Lütke Stockdiek_Grimme_Griesbach_Grimme_2025, title={Out of Order: On the Importance of Word Positions in Explaining Text Classification}, booktitle={International Artificial Intelligence Symposium}, author={Lütke Stockdiek, Janina and Grimme, Britta and Griesbach, Marie and Grimme, Christian}, year={2025}, pages={432–447} }","mla":"Lütke Stockdiek, Janina, et al. “Out of Order: On the Importance of Word Positions in Explaining Text Classification.” <i>International Artificial Intelligence Symposium</i>, 2025, pp. 432–447.","short":"J. Lütke Stockdiek, B. Grimme, M. Griesbach, C. Grimme, in: International Artificial Intelligence Symposium, 2025, pp. 432–447.","chicago":"Lütke Stockdiek, Janina, Britta Grimme, Marie Griesbach, and Christian Grimme. “Out of Order: On the Importance of Word Positions in Explaining Text Classification.” In <i>International Artificial Intelligence Symposium</i>, 432–447, 2025.","apa":"Lütke Stockdiek, J., Grimme, B., Griesbach, M., &#38; Grimme, C. (2025). Out of Order: On the Importance of Word Positions in Explaining Text Classification. <i>International Artificial Intelligence Symposium</i>, 432–447.","ieee":"J. Lütke Stockdiek, B. Grimme, M. Griesbach, and C. Grimme, “Out of Order: On the Importance of Word Positions in Explaining Text Classification,” in <i>International Artificial Intelligence Symposium</i>, 2025, pp. 432–447."},"date_created":"2026-07-01T12:32:42Z","type":"conference","department":[{"_id":"819"}]},{"_id":"58801","ddc":["006"],"user_id":"63563","status":"public","conference":{"location":"Virtual","start_date":"2025-02-20","name":"Free and Open Communications on the Internet","end_date":"2025-02-20"},"has_accepted_license":"1","oa":"1","file_date_updated":"2026-08-17T07:40:31Z","citation":{"ama":"Lange F, Niere N, von Niessen J, Suermann D, Heitmann N, Somorovsky J. I(ra)nconsistencies: Novel Insights into Iran’s Censorship. In: <i>Proceedings on Privacy Enhancing Technologies</i>. ; 2025.","bibtex":"@inproceedings{Lange_Niere_von Niessen_Suermann_Heitmann_Somorovsky_2025, title={I(ra)nconsistencies: Novel Insights into Iran’s Censorship}, booktitle={Proceedings on Privacy Enhancing Technologies}, author={Lange, Felix and Niere, Niklas and von Niessen, Jonathan and Suermann, Dennis and Heitmann, Nico and Somorovsky, Juraj}, year={2025} }","mla":"Lange, Felix, et al. “I(Ra)Nconsistencies: Novel Insights into Iran’s Censorship.” <i>Proceedings on Privacy Enhancing Technologies</i>, 2025.","chicago":"Lange, Felix, Niklas Niere, Jonathan von Niessen, Dennis Suermann, Nico Heitmann, and Juraj Somorovsky. “I(Ra)Nconsistencies: Novel Insights into Iran’s Censorship.” In <i>Proceedings on Privacy Enhancing Technologies</i>, 2025.","short":"F. Lange, N. Niere, J. von Niessen, D. Suermann, N. Heitmann, J. Somorovsky, in: Proceedings on Privacy Enhancing Technologies, 2025.","apa":"Lange, F., Niere, N., von Niessen, J., Suermann, D., Heitmann, N., &#38; Somorovsky, J. (2025). I(ra)nconsistencies: Novel Insights into Iran’s Censorship. <i>Proceedings on Privacy Enhancing Technologies</i>. Free and Open Communications on the Internet, Virtual.","ieee":"F. Lange, N. Niere, J. von Niessen, D. Suermann, N. Heitmann, and J. Somorovsky, “I(ra)nconsistencies: Novel Insights into Iran’s Censorship,” presented at the Free and Open Communications on the Internet, Virtual, 2025."},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.petsymposium.org/foci/2025/foci-2025-0002.pdf"}],"language":[{"iso":"eng"}],"title":"I(ra)nconsistencies: Novel Insights into Iran’s Censorship","year":"2025","author":[{"id":"67893","last_name":"Lange","first_name":"Felix","full_name":"Lange, Felix"},{"id":"63563","full_name":"Niere, Niklas","last_name":"Niere","first_name":"Niklas"},{"full_name":"von Niessen, Jonathan","last_name":"von Niessen","first_name":"Jonathan"},{"last_name":"Suermann","first_name":"Dennis","full_name":"Suermann, Dennis"},{"id":"74619","full_name":"Heitmann, Nico","first_name":"Nico","last_name":"Heitmann","orcid":"0009-0003-7687-7044"},{"id":"83504","full_name":"Somorovsky, Juraj","orcid":"0000-0002-3593-7720","first_name":"Juraj","last_name":"Somorovsky"}],"date_updated":"2026-08-17T07:40:31Z","file":[{"relation":"main_file","date_updated":"2026-08-17T07:40:31Z","file_name":"foci-2025-0002.pdf","file_size":535700,"access_level":"local","file_id":"58802","content_type":"application/pdf","creator":"flange","date_created":"2025-02-24T08:07:59Z"}],"date_created":"2025-02-24T08:09:56Z","type":"conference","department":[{"_id":"632"}],"publication":"Proceedings on Privacy Enhancing Technologies","abstract":[{"text":"Iran employs one of the most prominent Internet censors in the world. An important part of Iran’s censorship apparatus is its analysis of unencrypted protocols such as HTTP and DNS. During routine evaluations of Iran’s HTTP and DNS censorship, we noticed several properties we believe to be unknown today. For instance, we found injections of correct static IPs for some domains such as google.com on the DNS level, unclear HTTP version parsing, and correlations between DNS and HTTP censorship. In this paper, we present our findings to the community and discuss possible takeaways for affected people and the censorship circumvention community. As some of our findings left us bewildered, we hope to ignite a discussion about Iran’s censorship behavior. We aim to use the discussion of our work to execute a thorough analysis and explanation of Iran’s censorship behavior in the future.","lang":"eng"}]},{"author":[{"full_name":"Koldewey, Christian","last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian","id":"43136"},{"id":"66731","first_name":"Timm","last_name":"Fichtler","orcid":"https://orcid.org/0000-0001-6034-4399","full_name":"Fichtler, Timm"},{"first_name":"Michel","last_name":"Scholtysik","full_name":"Scholtysik, Michel","id":"50562"},{"full_name":"Biehler, Jan","first_name":"Jan","last_name":"Biehler"},{"first_name":"Nick","last_name":"Schreiner","full_name":"Schreiner, Nick"},{"full_name":"Sommer, Franziska","first_name":"Franziska","last_name":"Sommer"},{"last_name":"Schacht","first_name":"Maximilian","full_name":"Schacht, Maximilian"},{"last_name":"Kaufmann","first_name":"Jonas","full_name":"Kaufmann, Jonas"},{"full_name":"Rabe, Martin","first_name":"Martin","last_name":"Rabe"},{"full_name":"Sedlmeier, Joachim","last_name":"Sedlmeier","first_name":"Joachim"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"}],"conference":{"location":"Hawaii","name":"Hawaii International Conference on System Sciences","start_date":"2024-01-03","end_date":"2024-01-06"},"status":"public","title":"Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice","year":"2024","date_updated":"2023-11-06T15:40:33Z","_id":"48632","language":[{"iso":"eng"}],"user_id":"66731","citation":{"mla":"Koldewey, Christian, et al. <i>Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice</i>. 2024.","bibtex":"@inproceedings{Koldewey_Fichtler_Scholtysik_Biehler_Schreiner_Sommer_Schacht_Kaufmann_Rabe_Sedlmeier_et al._2024, title={Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice}, author={Koldewey, Christian and Fichtler, Timm and Scholtysik, Michel and Biehler, Jan and Schreiner, Nick and Sommer, Franziska and Schacht, Maximilian and Kaufmann, Jonas and Rabe, Martin and Sedlmeier, Joachim and et al.}, year={2024} }","ama":"Koldewey C, Fichtler T, Scholtysik M, et al. Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice. In: ; 2024.","ieee":"C. Koldewey <i>et al.</i>, “Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice,” presented at the Hawaii International Conference on System Sciences, Hawaii, 2024.","apa":"Koldewey, C., Fichtler, T., Scholtysik, M., Biehler, J., Schreiner, N., Sommer, F., Schacht, M., Kaufmann, J., Rabe, M., Sedlmeier, J., &#38; Dumitrescu, R. (2024). <i>Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice</i>. Hawaii International Conference on System Sciences, Hawaii.","short":"C. Koldewey, T. Fichtler, M. Scholtysik, J. Biehler, N. Schreiner, F. Sommer, M. Schacht, J. Kaufmann, M. Rabe, J. Sedlmeier, R. Dumitrescu, in: 2024.","chicago":"Koldewey, Christian, Timm Fichtler, Michel Scholtysik, Jan Biehler, Nick Schreiner, Franziska Sommer, Maximilian Schacht, et al. “Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice,” 2024."},"abstract":[{"lang":"eng","text":"Digital Servitization is one of the significant trends affecting the manufacturing industry. Companies try to tackle challenges regarding their differentiation and profitability using digital services. One specific type of digital services are smart services, which are digital services built on data from smart products. Introducing these kinds of offerings into the portfolio of manufacturing companies is not trivial. Moreover, they require conscious action to align all relevant capabilities to realize the respective business goals. However, what capabilities are generally relevant for smart services remains opaque. We conducted a systematic literature review to identify them and extended the results through an interview study. Our analysis results in 78 capabilities clustered among 12 principles and six dimensions. These results provide significant support for the smart service transformation of manufacturing companies and for structuring the research field of smart services."}],"date_created":"2023-11-06T15:31:32Z","department":[{"_id":"563"},{"_id":"241"}],"type":"conference","keyword":["Digital Servitization","Transformation","Capabilities","Maturity","Smart Services"]},{"type":"conference","department":[{"_id":"563"}],"date_created":"2023-11-30T09:59:41Z","publication":"ML4CPS 2023","citation":{"bibtex":"@inproceedings{Afroze_Merkelbach_von Enzberg_Dumitrescu_2024, title={Domain Knowledge Injection Guidance for Predictive Maintenance}, booktitle={ML4CPS 2023}, author={Afroze, Lameya and Merkelbach, Silke and von Enzberg, Sebastian and Dumitrescu, Roman}, year={2024} }","ama":"Afroze L, Merkelbach S, von Enzberg S, Dumitrescu R. Domain Knowledge Injection Guidance for Predictive Maintenance. In: <i>ML4CPS 2023</i>. ; 2024.","mla":"Afroze, Lameya, et al. “Domain Knowledge Injection Guidance for Predictive Maintenance.” <i>ML4CPS 2023</i>, 2024.","chicago":"Afroze, Lameya, Silke Merkelbach, Sebastian von Enzberg, and Roman Dumitrescu. “Domain Knowledge Injection Guidance for Predictive Maintenance.” In <i>ML4CPS 2023</i>, 2024.","short":"L. Afroze, S. Merkelbach, S. von Enzberg, R. Dumitrescu, in: ML4CPS 2023, 2024.","ieee":"L. Afroze, S. Merkelbach, S. von Enzberg, and R. Dumitrescu, “Domain Knowledge Injection Guidance for Predictive Maintenance,” presented at the ML4CPS – Machine Learning For Cyber-Physical Systems, Hamburg, 2024.","apa":"Afroze, L., Merkelbach, S., von Enzberg, S., &#38; Dumitrescu, R. (2024). Domain Knowledge Injection Guidance for Predictive Maintenance. <i>ML4CPS 2023</i>. ML4CPS – Machine Learning For Cyber-Physical Systems, Hamburg."},"user_id":"15782","language":[{"iso":"eng"}],"_id":"49354","date_updated":"2023-11-30T14:09:47Z","title":"Domain Knowledge Injection Guidance for Predictive Maintenance","year":"2024","status":"public","author":[{"last_name":"Afroze","first_name":"Lameya","full_name":"Afroze, Lameya"},{"last_name":"Merkelbach","first_name":"Silke","full_name":"Merkelbach, Silke"},{"full_name":"von Enzberg, Sebastian","last_name":"von Enzberg","first_name":"Sebastian"},{"id":"16190","full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"}],"conference":{"location":"Hamburg","name":"ML4CPS – Machine Learning For Cyber-Physical Systems","start_date":"2023-03-29","end_date":"2023-0331"}},{"citation":{"mla":"Scholtysik, Michel, et al. <i>Business Strategy Taxonomy and Solution Patterns for the Circular Economy</i>. 2024.","ama":"Scholtysik M, Rohde M, Koldewey C, Dumitrescu R. Business strategy taxonomy and solution patterns for the circular economy. In: ; 2024.","bibtex":"@inproceedings{Scholtysik_Rohde_Koldewey_Dumitrescu_2024, title={Business strategy taxonomy and solution patterns for the circular economy}, author={Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}, year={2024} }","apa":"Scholtysik, M., Rohde, M., Koldewey, C., &#38; Dumitrescu, R. (2024). <i>Business strategy taxonomy and solution patterns for the circular economy</i>.","ieee":"M. Scholtysik, M. Rohde, C. Koldewey, and R. Dumitrescu, “Business strategy taxonomy and solution patterns for the circular economy,” 2024.","short":"M. Scholtysik, M. Rohde, C. Koldewey, R. Dumitrescu, in: 2024.","chicago":"Scholtysik, Michel, Malte Rohde, Christian Koldewey, and Roman Dumitrescu. “Business Strategy Taxonomy and Solution Patterns for the Circular Economy,” 2024."},"date_created":"2023-11-30T10:57:30Z","type":"conference","department":[{"_id":"563"}],"year":"2024","status":"public","title":"Business strategy taxonomy and solution patterns for the circular economy","author":[{"full_name":"Scholtysik, Michel","last_name":"Scholtysik","first_name":"Michel","id":"50562"},{"last_name":"Rohde","first_name":"Malte","full_name":"Rohde, Malte"},{"first_name":"Christian","last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","full_name":"Koldewey, Christian","id":"43136"},{"id":"16190","full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman"}],"date_updated":"2023-11-30T14:27:55Z","_id":"49364","language":[{"iso":"eng"}],"user_id":"50562"},{"date_updated":"2024-02-06T08:52:44Z","title":"Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency","status":"public","year":"2024","author":[{"last_name":"Philipp","first_name":"Friedrich M.","full_name":"Philipp, Friedrich M."},{"first_name":"Manuel","last_name":"Schaller","full_name":"Schaller, Manuel"},{"full_name":"Boshoff, Septimus","first_name":"Septimus","last_name":"Boshoff"},{"id":"47427","last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian"},{"first_name":"Feliks","last_name":"Nüske","full_name":"Nüske, Feliks"},{"last_name":"Worthmann","first_name":"Karl","full_name":"Worthmann, Karl"}],"user_id":"47427","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2402.02494.pdf"}],"language":[{"iso":"eng"}],"_id":"51160","abstract":[{"lang":"eng","text":"We rigorously derive novel and sharp finite-data error bounds for highly\r\nsample-efficient Extended Dynamic Mode Decomposition (EDMD) for both i.i.d. and\r\nergodic sampling. In particular, we show all results in a very general setting\r\nremoving most of the typically imposed assumptions such that, among others,\r\ndiscrete- and continuous-time stochastic processes as well as nonlinear partial\r\ndifferential equations are contained in the considered system class. Besides\r\nshowing an exponential rate for i.i.d. sampling, we prove, to the best of our\r\nknowledge, the first superlinear convergence rates for ergodic sampling of\r\ndeterministic systems. We verify sharpness of the derived error bounds by\r\nconducting numerical simulations for highly-complex applications from molecular\r\ndynamics and chaotic flame propagation."}],"publication":"arXiv:2402.02494","citation":{"ieee":"F. M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, and K. Worthmann, “Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency,” <i>arXiv:2402.02494</i>. 2024.","mla":"Philipp, Friedrich M., et al. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” <i>ArXiv:2402.02494</i>, 2024.","apa":"Philipp, F. M., Schaller, M., Boshoff, S., Peitz, S., Nüske, F., &#38; Worthmann, K. (2024). Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. In <i>arXiv:2402.02494</i>.","bibtex":"@article{Philipp_Schaller_Boshoff_Peitz_Nüske_Worthmann_2024, title={Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency}, journal={arXiv:2402.02494}, author={Philipp, Friedrich M. and Schaller, Manuel and Boshoff, Septimus and Peitz, Sebastian and Nüske, Feliks and Worthmann, Karl}, year={2024} }","chicago":"Philipp, Friedrich M., Manuel Schaller, Septimus Boshoff, Sebastian Peitz, Feliks Nüske, and Karl Worthmann. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” <i>ArXiv:2402.02494</i>, 2024.","ama":"Philipp FM, Schaller M, Boshoff S, Peitz S, Nüske F, Worthmann K. Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. <i>arXiv:240202494</i>. Published online 2024.","short":"F.M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, K. Worthmann, ArXiv:2402.02494 (2024)."},"type":"preprint","department":[{"_id":"655"}],"oa":"1","external_id":{"arxiv":["2402.02494"]},"date_created":"2024-02-06T08:52:21Z"},{"date_created":"2023-07-12T06:35:58Z","type":"journal_article","department":[{"_id":"101"},{"_id":"655"}],"oa":"1","publication":"Journal of Optimization Theory and Applications","citation":{"mla":"Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” <i>Journal of Optimization Theory and Applications</i>, Springer, 2024, doi:<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>.","bibtex":"@article{Sonntag_Peitz_2024, title={Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}, DOI={<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>}, journal={Journal of Optimization Theory and Applications}, publisher={Springer}, author={Sonntag, Konstantin and Peitz, Sebastian}, year={2024} }","ama":"Sonntag K, Peitz S. Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. <i>Journal of Optimization Theory and Applications</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>","ieee":"K. Sonntag and S. Peitz, “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems,” <i>Journal of Optimization Theory and Applications</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>.","apa":"Sonntag, K., &#38; Peitz, S. (2024). Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. <i>Journal of Optimization Theory and Applications</i>. <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">https://doi.org/10.1007/s10957-024-02389-3</a>","chicago":"Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” <i>Journal of Optimization Theory and Applications</i>, 2024. <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">https://doi.org/10.1007/s10957-024-02389-3</a>.","short":"K. Sonntag, S. Peitz, Journal of Optimization Theory and Applications (2024)."},"abstract":[{"text":"We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10957-024-02389-3.pdf"}],"_id":"46019","publisher":"Springer","language":[{"iso":"eng"}],"user_id":"56399","doi":"10.1007/s10957-024-02389-3","year":"2024","status":"public","title":"Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems","author":[{"full_name":"Sonntag, Konstantin","orcid":"https://orcid.org/0000-0003-3384-3496","last_name":"Sonntag","first_name":"Konstantin","id":"56399"},{"first_name":"Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian","id":"47427"}],"publication_status":"published","date_updated":"2024-02-21T10:13:33Z"},{"publication":"arXiv:2402.06376","citation":{"mla":"Sonntag, Konstantin, et al. “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.” <i>ArXiv:2402.06376</i>, 2024.","ama":"Sonntag K, Gebken B, Müller G, Peitz S, Volkwein S. A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. <i>arXiv:240206376</i>. Published online 2024.","bibtex":"@article{Sonntag_Gebken_Müller_Peitz_Volkwein_2024, title={A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces}, journal={arXiv:2402.06376}, author={Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}, year={2024} }","apa":"Sonntag, K., Gebken, B., Müller, G., Peitz, S., &#38; Volkwein, S. (2024). A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. In <i>arXiv:2402.06376</i>.","ieee":"K. Sonntag, B. Gebken, G. Müller, S. Peitz, and S. Volkwein, “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces,” <i>arXiv:2402.06376</i>. 2024.","short":"K. Sonntag, B. Gebken, G. Müller, S. Peitz, S. Volkwein, ArXiv:2402.06376 (2024).","chicago":"Sonntag, Konstantin, Bennet Gebken, Georg Müller, Sebastian Peitz, and Stefan Volkwein. “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.” <i>ArXiv:2402.06376</i>, 2024."},"abstract":[{"lang":"eng","text":"The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem."}],"external_id":{"arxiv":["\t2402.06376"]},"date_created":"2024-02-13T09:35:26Z","type":"preprint","department":[{"_id":"101"},{"_id":"655"}],"oa":"1","status":"public","title":"A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces","year":"2024","author":[{"full_name":"Sonntag, Konstantin","last_name":"Sonntag","orcid":"https://orcid.org/0000-0003-3384-3496","first_name":"Konstantin","id":"56399"},{"id":"32643","last_name":"Gebken","first_name":"Bennet","full_name":"Gebken, Bennet"},{"first_name":"Georg","last_name":"Müller","full_name":"Müller, Georg"},{"last_name":"Peitz","orcid":"0000-0002-3389-793X","first_name":"Sebastian","full_name":"Peitz, Sebastian","id":"47427"},{"last_name":"Volkwein","first_name":"Stefan","full_name":"Volkwein, Stefan"}],"date_updated":"2024-02-21T10:21:03Z","has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2402.06376"}],"_id":"51334","language":[{"iso":"eng"}],"user_id":"56399"},{"status":"public","user_id":"47427","volume":461,"page":"134096","publisher":"Elsevier","_id":"40171","citation":{"apa":"Peitz, S., Stenner, J., Chidananda, V., Wallscheid, O., Brunton, S. L., &#38; Taira, K. (2024). Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning. <i>Physica D: Nonlinear Phenomena</i>, <i>461</i>, 134096. <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">https://doi.org/10.1016/j.physd.2024.134096</a>","ieee":"S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S. L. Brunton, and K. Taira, “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning,” <i>Physica D: Nonlinear Phenomena</i>, vol. 461, p. 134096, 2024, doi: <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>.","short":"S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S.L. Brunton, K. Taira, Physica D: Nonlinear Phenomena 461 (2024) 134096.","chicago":"Peitz, Sebastian, Jan Stenner, Vikas Chidananda, Oliver Wallscheid, Steven L. Brunton, and Kunihiko Taira. “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning.” <i>Physica D: Nonlinear Phenomena</i> 461 (2024): 134096. <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">https://doi.org/10.1016/j.physd.2024.134096</a>.","mla":"Peitz, Sebastian, et al. “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning.” <i>Physica D: Nonlinear Phenomena</i>, vol. 461, Elsevier, 2024, p. 134096, doi:<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>.","ama":"Peitz S, Stenner J, Chidananda V, Wallscheid O, Brunton SL, Taira K. Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning. <i>Physica D: Nonlinear Phenomena</i>. 2024;461:134096. doi:<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>","bibtex":"@article{Peitz_Stenner_Chidananda_Wallscheid_Brunton_Taira_2024, title={Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning}, volume={461}, DOI={<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>}, journal={Physica D: Nonlinear Phenomena}, publisher={Elsevier}, author={Peitz, Sebastian and Stenner, Jan and Chidananda, Vikas and Wallscheid, Oliver and Brunton, Steven L. and Taira, Kunihiko}, year={2024}, pages={134096} }"},"oa":"1","date_updated":"2024-02-23T10:53:42Z","article_type":"original","intvolume":"       461","title":"Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning","year":"2024","author":[{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X"},{"full_name":"Stenner, Jan","first_name":"Jan","last_name":"Stenner","id":"65520"},{"full_name":"Chidananda, Vikas","first_name":"Vikas","last_name":"Chidananda"},{"orcid":"https://orcid.org/0000-0001-9362-8777","last_name":"Wallscheid","first_name":"Oliver","full_name":"Wallscheid, Oliver","id":"11291"},{"full_name":"Brunton, Steven L.","last_name":"Brunton","first_name":"Steven L."},{"last_name":"Taira","first_name":"Kunihiko","full_name":"Taira, Kunihiko"}],"doi":"10.1016/j.physd.2024.134096","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.physd.2024.134096"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We present a convolutional framework which significantly reduces the complexity and thus, the computational effort for distributed reinforcement learning control of dynamical systems governed by partial differential equations (PDEs). Exploiting translational equivariances, the high-dimensional distributed control problem can be transformed into a multi-agent control problem with many identical, uncoupled agents. Furthermore, using the fact that information is transported with finite velocity in many cases, the dimension of the agents’ environment can be drastically reduced using a convolution operation over the state space of the PDE, by which we effectively tackle the curse of dimensionality otherwise present in deep reinforcement learning. In this setting, the complexity can be flexibly adjusted via the kernel width or by using a stride greater than one (meaning that we do not place an actuator at each sensor location). Moreover, scaling from smaller to larger domains – or the transfer between different domains – becomes a straightforward task requiring little effort. We demonstrate the performance of the proposed framework using several PDE examples with increasing complexity, where stabilization is achieved by training a low-dimensional deep deterministic policy gradient agent using minimal computing resources."}],"publication":"Physica D: Nonlinear Phenomena","type":"journal_article","department":[{"_id":"655"}],"date_created":"2023-01-26T07:56:26Z"}]