Publications related to Why computational complexity may set impenetrable barriers for epistemic reductionism

Inhalation of Microplastics—A Toxicological Complexity

Florian Frédéric Vincent Breider, Myriam Borgatta

Humans are chronically exposed to airborne microplastics (MPs) by inhalation. Various types of polymer particles have been detected in lung samples, which could pose a threat to human health. Inhalation toxicological studies are crucial for assessing the e ...

2024

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Aude Billard, Nadia Barbara Figueroa Fernandez, Mikhail Koptev

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is construc ...

Sage Publications Ltd2024

Fast refacing of MR images with a generative neural network lowers re-identification risk and preserves volumetric consistency

Jean-Philippe Thiran, Tobias Kober, Bénédicte Marie Maréchal, Jonas Richiardi

With the rise of open data, identifiability of individuals based on 3D renderings obtained from routine structural magnetic resonance imaging (MRI) scans of the head has become a growing privacy concern. To protect subject privacy, several algorithms have ...

Wiley2024

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Tianshu Yang, Xue Zhang

In this paper, we propose an analytical stochastic dynamic programming (SDP) algorithm to address the optimal management problem of price-maker community energy storage. As a price-maker, energy storage smooths price differences, thus decreasing energy arb ...

China Electric Power Research Inst2024

Quantum Protocols for ML, Physics, and Finance

Grzegorz Adam Gluch

In this thesis, we give new protocols that offer a quantum advantage for problems in ML, Physics, and Finance.Quantum mechanics gives predictions that are inconsistent with local realism.The experiment proving this fact (Bell, 1964) gives a quantum protoco ...

EPFL2024

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Giuseppe Carleo, Sofia Vallecorsa

Entanglement forging based variational algorithms leverage the bipartition of quantum systems for addressing ground-state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous potential basis stat ...

Amer Physical Soc2024

Reliable data-driven decision-making through optimal transport

Bahar Taskesen

Decision-making permeates every aspect of human and societal development, from individuals' daily choices to the complex decisions made by communities and institutions. Central to effective decision-making is the discipline of optimization, which seeks the ...

EPFL2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Graph generative deep learning models with an application to circuit topologies

Igor Krawczuk

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison.Managing their complexity and facilitating their design drove part of the co-evolution of moder ...

EPFL2024

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Association for Computing Machinery2024

Why computational complexity may set impenetrable barriers for epistemic reductionism

Graph Chatbot

Chat with Graph Search

Inhalation of Microplastics—A Toxicological Complexity

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Fast refacing of MR images with a generative neural network lowers re-identification risk and preserves volumetric consistency

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Quantum Protocols for ML, Physics, and Finance

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Reliable data-driven decision-making through optimal transport

Efficient Continual Finite-Sum Minimization

Graph generative deep learning models with an application to circuit topologies

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Inhalation of Microplastics—A Toxicological Complexity

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Fast refacing of MR images with a generative neural network lowers re-identification risk and preserves volumetric consistency

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Quantum Protocols for ML, Physics, and Finance

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Reliable data-driven decision-making through optimal transport

Efficient Continual Finite-Sum Minimization

Graph generative deep learning models with an application to circuit topologies

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving