@article{53073, abstract = {{While shallow decision trees may be interpretable, larger ensemble models like gradient-boosted trees, which often set the state of the art in machine learning problems involving tabular data, still remain black box models. As a remedy, the Shapley value (SV) is a well-known concept in explainable artificial intelligence (XAI) research for quantifying additive feature attributions of predictions. The model-specific TreeSHAP methodology solves the exponential complexity for retrieving exact SVs from tree-based models. Expanding beyond individual feature attribution, Shapley interactions reveal the impact of intricate feature interactions of any order. In this work, we present TreeSHAP-IQ, an efficient method to compute any-order additive Shapley interactions for predictions of tree-based models. TreeSHAP-IQ is supported by a mathematical framework that exploits polynomial arithmetic to compute the interaction scores in a single recursive traversal of the tree, akin to Linear TreeSHAP. We apply TreeSHAP-IQ on state-of-the-art tree ensembles and explore interactions on well-established benchmark datasets.}}, author = {{Muschalik, Maximilian and Fumagalli, Fabian and Hammer, Barbara and Huellermeier, Eyke}}, issn = {{2374-3468}}, journal = {{Proceedings of the AAAI Conference on Artificial Intelligence}}, keywords = {{Explainable Artificial Intelligence}}, number = {{13}}, pages = {{14388--14396}}, publisher = {{Association for the Advancement of Artificial Intelligence (AAAI)}}, title = {{{Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree Ensembles}}}, doi = {{10.1609/aaai.v38i13.29352}}, volume = {{38}}, year = {{2024}}, } @unpublished{50406, abstract = {{What is the power of polynomial-time quantum computation with access to an NP oracle? In this work, we focus on two fundamental tasks from the study of Boolean satisfiability (SAT) problems: search-to-decision reductions, and approximate counting. We first show that, in strong contrast to the classical setting where a poly-time Turing machine requires $\Theta(n)$ queries to an NP oracle to compute a witness to a given SAT formula, quantumly $\Theta(\log n)$ queries suffice. We then show this is tight in the black-box model - any quantum algorithm with "NP-like" query access to a formula requires $\Omega(\log n)$ queries to extract a solution with constant probability. Moving to approximate counting of SAT solutions, by exploiting a quantum link between search-to-decision reductions and approximate counting, we show that existing classical approximate counting algorithms are likely optimal. First, we give a lower bound in the "NP-like" black-box query setting: Approximate counting requires $\Omega(\log n)$ queries, even on a quantum computer. We then give a "white-box" lower bound (i.e. where the input formula is not hidden in the oracle) - if there exists a randomized poly-time classical or quantum algorithm for approximate counting making $o(log n)$ NP queries, then $\text{BPP}^{\text{NP}[o(n)]}$ contains a $\text{P}^{\text{NP}}$-complete problem if the algorithm is classical and $\text{FBQP}^{\text{NP}[o(n)]}$ contains an $\text{FP}^{\text{NP}}$-complete problem if the algorithm is quantum.}}, author = {{Gharibian, Sevag and Kamminga, Jonas}}, booktitle = {{arXiv:2401.03943}}, title = {{{BQP, meet NP: Search-to-decision reductions and approximate counting}}}, year = {{2024}}, } @inproceedings{52212, author = {{Tews, Karina and Teutenberg, Dominik and Meschut, Gerson and Buczek, Moritz and Duffe, Tobias and Kullmer, Gunter}}, booktitle = {{24. Kolloquium: Gemeinsame Forschung in der Klebtechnik}}, location = {{Köln}}, title = {{{Bruchmechanisches Schnittebenenkonzept zur lebensdauergerechten Auslegung von hyperelastischen Klebverbindungen bei multiaxialen und variablen Belastungsamplituden}}}, year = {{2024}}, } @inproceedings{49364, author = {{Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}}, title = {{{Business strategy taxonomy and solution patterns for the circular economy}}}, year = {{2024}}, } @article{51221, abstract = {{Charge transfer mechanism in the deprotonation-induced n-type doping of PCBM.}}, author = {{Dong, Chuan-Ding and Bauch, Fabian and Hu, Yuanyuan and Schumacher, Stefan}}, issn = {{1463-9076}}, journal = {{Physical Chemistry Chemical Physics}}, keywords = {{Physical and Theoretical Chemistry, General Physics and Astronomy}}, number = {{5}}, pages = {{4194--4199}}, publisher = {{Royal Society of Chemistry (RSC)}}, title = {{{Charge transfer in superbase n-type doping of PCBM induced by deprotonation}}}, doi = {{10.1039/d3cp05105f}}, volume = {{26}}, year = {{2024}}, } @inbook{51098, author = {{Labusch, Amelie and Eickelmann, Birgit and Casamassima, Gianna and Drossel, Kerstin and Gudmundsdottir, G.B. and Kazani, A. and Mifsud, L. and Symeonaki, M. and Teidla-Kunitsõn, G.}}, booktitle = {{Understanding the everyday digital lives of children and young people }}, editor = {{Holmarsdottir, H.B. and Seland, I. and Hyggen, C. and Roth, M.}}, pages = {{321--350}}, publisher = {{Palgrave Macmillan}}, title = {{{Children and young people’s ICT experiences in school education: Participatory research design to engage children and young people as experts in research}}}, doi = {{https://doi.org/10.1007/978-3-031-46929-9}}, year = {{2024}}, } @misc{51624, author = {{Staffel, Florian Lukas}}, booktitle = {{Sehepunkte}}, number = {{2}}, title = {{{Christian Marx: Wegbereiter der Globalisierung. Multinationale Unternehmen der westeuropäischen Chemieindustrie in der Zeit nach dem Boom (1960er-2000er Jahre) (= Nach dem Boom), Göttingen 2023.}}}, volume = {{24}}, year = {{2024}}, } @inproceedings{49363, author = {{Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}}, title = {{{Circular Product-Service-System Ideation Canvas – A Framework for the Design of circular Product-Service-System Ideas}}}, year = {{2024}}, } @article{52332, author = {{Intveen, Julie}}, journal = {{MEIN FACH - Englisch Sek II}}, title = {{{Commonwealth Connections. Discovering global dynamics through Model UN discourse}}}, volume = {{1}}, year = {{2024}}, } @article{49652, abstract = {{Broadband coherent anti-Stokes Raman scattering (BCARS) is a powerful spectroscopy method combining high signal intensity with spectral sensitivity, enabling rapid imaging of heterogeneous samples in biomedical research and, more recently, in crystalline materials. However, BCARS encounters spectral distortion due to a setup-dependent non-resonant background (NRB). This study assesses BCARS reproducibility through a round robin experiment using two distinct BCARS setups and crystalline materials with varying structural complexity, including diamond, 6H-SiC, KDP, and KTP. The analysis compares setup-specific NRB correction procedures, detected and NRB-removed spectra, and mode assignment. We determine the influence of BCARS setup parameters like pump wavelength, pulse width, and detection geometry and provide a practical guide for optimizing BCARS setups for solid-state applications.}}, author = {{Hempel, Franz and Vernuccio, Federico and König, Lukas and Buschbeck, Robin and Rüsing, Michael and Cerullo, Giulio and Polli, Dario and Eng, Lukas M.}}, issn = {{1559-128X}}, journal = {{Applied Optics}}, keywords = {{Atomic and Molecular Physics, and Optics, Engineering (miscellaneous), Electrical and Electronic Engineering}}, number = {{1}}, publisher = {{Optica Publishing Group}}, title = {{{Comparing transmission- and epi-BCARS: a round robin on solid-state materials}}}, doi = {{10.1364/ao.505374}}, volume = {{63}}, year = {{2024}}, }