SearcharxivSearch

arXiv subjects

Sebastian Becker

Publications and source records attributed to Sebastian Becker.

At least 19 recordsLinked to original sources

DFCA: Decentralized Federated Clustering Algorithm

Clustered Federated Learning has emerged as an effective approach for handling heterogeneous data across clients by partitioning them into clusters with similar or identical data distributions. However, most existing methods, including the Iterative Federated Clustering Algorithm (IFCA), rely on a central server to coordinate model updates, which creates a bottleneck and a single point of failure, limiting their applicability in more realistic decentralized learning settings. In this work, we introduce DFCA, a fully decentralized clustered FL algorithm that enables clients to collaboratively train cluster-specific models without central coordination. DFCA uses a sequential running average to aggregate models from neighbors as updates arrive, providing a communication-efficient alternative to batch aggregation while maintaining clustering performance. Our experiments on various datasets demonstrate that DFCA outperforms other decentralized algorithms and performs comparably to centralized IFCA, even under sparse connectivity, highlighting its robustness and practicality for dynamic real-world decentralized networks.

cs.LG

Expert Survey: AI Reliability & Security Research Priorities

Our survey of 53 specialists across 105 AI reliability and security research areas identifies the most promising research prospects to guide strategic AI R&D investment. As companies are seeking to develop AI systems with broadly human-level capabilities, research on reliability and security is urgently needed to ensure AI's benefits can be safely and broadly realized and prevent severe harms. This study is the first to quantify expert priorities across a comprehensive taxonomy of AI safety and security research directions and to produce a data-driven ranking of their potential impact. These rankings may support evidence-based decisions about how to effectively deploy resources toward AI reliability and security research.

cs.CY

Temperature-driven confinements of surface electrons and adatoms in a weakly interacting 2D organic porous network

Two-dimensional organic porous networks (2DOPNs) have opened new vistas for tailoring the physicochemical characteristics of metallic surfaces. These typically chemically bound nanoporous structures act as periodical quantum wells leading to the 2D confinements of surface electron gases, adatoms and molecular guests. Here we propose a new type of porous network with weakly interacting 2,4,6-triphenyl-1,3,5-triazine (TPT) molecules on a Cu(111) surface, in which a temperature-driven (T-driven) phase transition can reversibly alter the supramolecular structures from a close-packed (CP-TPT) phase to a porous-network (PN-TPT) phase. Crucially, only the low-temperature PN-TPT exhibits subnano-scale cavities that can confine the surface state electrons and metal adatoms. The confined surface electrons undergo a significant electronic band renormalization. To activate the spin degree of freedom, the T-driven PN-TPT structure can additionally trap Co atoms within the cavities, forming highly ordered quantum dots. Our theoretical simulation reveals a complex spin carrier transfer from the confined Co cluster to the neighbouring TPT molecules via the underlying substrate. Our results demonstrate that weakly interacting 2DOPN offers a unique quantum switch capable of steering and controlling electrons and spin at surfaces via tailored quantum confinements.

cond-mat.mtrl-sci

An efficient Monte Carlo scheme for Zakai equations

In this paper we develop a numerical method for efficiently approximating solutions of certain Zakai equations in high dimensions. The key idea is to transform a given Zakai SPDE into a PDE with random coefficients. We show that under suitable regularity assumptions on the coefficients of the Zakai equation, the corresponding random PDE admits a solution random field which, for almost all realizations of the random coefficients, can be written as a classical solution of a linear parabolic PDE. This makes it possible to apply the Feynman--Kac formula to obtain an efficient Monte Carlo scheme for computing approximate solutions of Zakai equations. The approach achieves good results in up to 25 dimensions with fast run times.

math.NA

Development and validation of the Converging Lenses Concept Inventory for middle school physics education

Optics is a core field in the curricula of secondary physics education. In this study, we present the development and validation of a test instrument in the field of optics, the Converging Lenses Concept Inventory (CLCI). It can be used as a formative or a summative assessment of middle school students' conceptual understanding of image formation by converging lenses. The CLCI assesses: (1) the overall understanding of fundamental concepts related to converging lenses, (2) the understanding of specific concepts, and (3) students' propensity for difficulties within this topic. The initial CLCI consists of 16 multiple-choice items; however, one item was removed based on various quality checks. We validated the CLCI thoroughly with distractor analyses, classical test theory, item response theory, structural analyses, and analyses of students' total scores at different measurement points as quantitative approaches, as well as student interviews and an expert survey as qualitative approaches. The quantitative analyses are mostly based on a dataset of N = 318 middle school students who took the CLCI as a posttest. The student interviews were conducted with seven middle school students after they were taught the concepts of converging lenses. The expert survey included five experts who evaluated both individual items and the test as a whole. The analyses showed good to excellent results for the test instrument, corroborating the 15-item CLCI's validity and its compliance with the three foci outlined above.

physics.ed-ph

Deep learning approximations for non-local nonlinear PDEs with Neumann boundary conditions

Nonlinear partial differential equations (PDEs) are used to model dynamical processes in a large number of scientific fields, ranging from finance to biology. In many applications standard local models are not sufficient to accurately account for certain non-local phenomena such as, e.g., interactions at a distance. In order to properly capture these phenomena non-local nonlinear PDE models are frequently employed in the literature. In this article we propose two numerical methods based on machine learning and on Picard iterations, respectively, to approximately solve non-local nonlinear PDEs. The proposed machine learning-based method is an extended variant of a deep learning-based splitting-up type approximation method previously introduced in the literature and utilizes neural networks to provide approximate solutions on a subset of the spatial domain of the solution. The Picard iterations-based method is an extended variant of the so-called full history recursive multilevel Picard approximation scheme previously introduced in the literature and provides an approximate solution for a single point of the domain. Both methods are mesh-free and allow non-local nonlinear PDEs with Neumann boundary conditions to be solved in high dimensions. In the two methods, the numerical difficulties arising due to the dimensionality of the PDEs are avoided by (i) using the correspondence between the expected trajectory of reflected stochastic processes and the solution of PDEs (given by the Feynman-Kac formula) and by (ii) using a plain vanilla Monte Carlo integration to handle the non-local term. We evaluate the performance of the two methods on five different PDEs arising in physics and biology. In all cases, the methods yield good results in up to 10 dimensions with short run times. Our work extends recently developed methods to overcome the curse of dimensionality in solving PDEs.

math.NA

Learning the random variables in Monte Carlo simulations with stochastic gradient descent: Machine learning for parametric PDEs and financial derivative pricing

In financial engineering, prices of financial products are computed approximately many times each trading day with (slightly) different parameters in each calculation. In many financial models such prices can be approximated by means of Monte Carlo (MC) simulations. To obtain a good approximation the MC sample size usually needs to be considerably large resulting in a long computing time to obtain a single approximation. In this paper we introduce a new approximation strategy for parametric approximation problems including the parametric financial pricing problems described above. A central aspect of the approximation strategy proposed in this article is to combine MC algorithms with machine learning techniques to, roughly speaking, learn the random variables (LRV) in MC simulations. In other words, we employ stochastic gradient descent (SGD) optimization methods not to train parameters of standard artificial neural networks (ANNs) but to learn random variables appearing in MC approximations. We numerically test the LRV strategy on various parametric problems with convincing results when compared with standard MC simulations, Quasi-Monte Carlo simulations, SGD-trained shallow ANNs, and SGD-trained deep ANNs. Our numerical simulations strongly indicate that the LRV strategy might be capable to overcome the curse of dimensionality in the $L^\infty$-norm in several cases where the standard deep learning approach has been proven not to be able to do so. This is not a contradiction to lower bounds established in the scientific literature because this new LRV strategy is outside of the class of algorithms for which lower bounds have been established in the scientific literature. The proposed LRV strategy is of general nature and not only restricted to the parametric financial pricing problems described above, but applicable to a large class of approximation problems.

math.NA

Deep learning based numerical approximation algorithms for stochastic partial differential equations

In this article, we introduce a deep learning based approximation algorithm for SPDEs. Our approach employs neural networks to approximate the solutions of SPDEs along given realizations of the driving noise process. If applied to a set of simulated noise trajectories, it yields empirical distributions of SPDE solutions, from which functionals like the mean and variance can be estimated. We test the performance of the method on stochastic heat equations with additive and multiplicative noise as well as stochastic Black-Scholes equations with multiplicative noise and Zakai equations from nonlinear filtering theory. In all cases, the proposed algorithm yields accurate results with short runtimes in up to 100 space dimensions.

math.NA

Numerical simulations for full history recursive multilevel Picard approximations for systems of high-dimensional partial differential equations

One of the most challenging issues in applied mathematics is to develop and analyze algorithms which are able to approximately compute solutions of high-dimensional nonlinear partial differential equations (PDEs). In particular, it is very hard to develop approximation algorithms which do not suffer under the curse of dimensionality in the sense that the number of computational operations needed by the algorithm to compute an approximation of accuracy $\epsilon > 0$ grows at most polynomially in both the reciprocal $1/\epsilon$ of the required accuracy and the dimension $d \in \mathbb{N}$ of the PDE. Recently, a new approximation method, the so-called full history recursive multilevel Picard (MLP) approximation method, has been introduced and, until today, this approximation scheme is the only approximation method in the scientific literature which has been proven to overcome the curse of dimensionality in the numerical approximation of semilinear PDEs with general time horizons. It is a key contribution of this article to extend the MLP approximation method to systems of semilinear PDEs and to numerically test it on several example PDEs. More specifically, we apply the proposed MLP approximation method in the case of Allen-Cahn PDEs, Sine-Gordon-type PDEs, systems of coupled semilinear heat PDEs, and semilinear Black-Scholes PDEs in up to 1000 dimensions. The presented numerical simulation results suggest in the case of each of these example PDEs that the proposed MLP approximation method produces very accurate results in short runtimes and, in particular, the presented numerical simulation results indicate that the proposed MLP approximation scheme significantly outperforms certain deep learning based approximation methods for high-dimensional semilinear PDEs.

math.NA

Pricing and hedging American-style options with deep learning

In this paper we introduce a deep learning method for pricing and hedging American-style options. It first computes a candidate optimal stopping policy. From there it derives a lower bound for the price. Then it calculates an upper bound, a point estimate and confidence intervals. Finally, it constructs an approximate dynamic hedging strategy. We test the approach on different specifications of a Bermudan max-call option. In all cases it produces highly accurate prices and dynamic hedging strategies with small replication errors.

q-fin.CP

Visual attention while solving the test of understanding graphs in kinematics: An eye-tracking analysis

This study used eye-tracking to capture the students' visual attention while taking the test of understanding graphs in kinematics (TUG-K). A total of N = 115 upper-secondary-level students from Germany and Switzerland took the 26-item multiple-choice instrument after learning about kinematics graphs in the regular classroom. Besides choosing the correct alternative among research-based distractors, the students were required to judge their response confidence for each question. The items were presented sequentially on a computer screen equipped with a remote eye tracker, resulting in a set of approx. 3000 paired responses (accuracy and confidence) and about 40 hours of eye movementdata (approx. 500.000 fixations). The analysis of students' visual attention related to the item stems (questions) and the item options reveal that high response confidence is correlated with shorter visit duration on both elements of the items. While the students' response accuracy and their response confidence are highly correlated on the score level, r(115) = 0.63, p < 0.001, the eye-tracking measures do not sufficiently discriminate between correct and incorrect responses. However, a more fine-grained analysis of visual attention based on different answer options reveals a significant discrimination between correct and incorrect answers in terms of an interaction effect: Incorrect responses are associated with longer visit durations on strong distractors and less time spent on correct options while correct responses show the opposite trend. Outcomes of this study provide new insights into the validation of concept inventories based on students' behavioural level.

physics.ed-ph

Using Mobile Devices to Augment Inquiry-Based Learning Processes with Multiple Representations

Technological advances offer the possibility of using mobile devices to enrich learning environments with multimedia content. Although physical experiments play a key role in science learning, little is known about integrating multimedia learning in physical experimental processes, especially in real classroom settings. In our approach, students use tablet PCs to investigate motions with an application providing multiple representations of the measurement data. We present the results of a cluster-randomized controlled trial (N=262 matched samples) that covered the topic uniform motion. The results show that the treatment not only leads to a significant reduction of extraneous cognitive load (F(1,240)=27.01, p<10-3, ${\eta}$2=0.101, $1-{\beta}$=1.000), but also to greater conceptual knowledge (F(1,259)=10.82, p=0.001, ${\eta}$2=0.048, $1-{\beta}$=0.953). Structure equation modeling statistically supports the assumption of a causal relationship between the reduction of extraneous cognitive load and the increase in conceptual understanding.

physics.ed-ph

Solving high-dimensional optimal stopping problems using deep learning

Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlying assets. High-dimensional optimal stopping problems are, however, notoriously difficult to solve due to the well-known curse of dimensionality. In this work, we propose an algorithm for solving such problems, which is based on deep learning and computes, in the context of early exercise option pricing, both approximations of an optimal exercise strategy and the price of the considered option. The proposed algorithm can also be applied to optimal stopping problems that arise in other areas where the underlying stochastic process can be efficiently simulated. We present numerical results for a large number of example problems, which include the pricing of many high-dimensional American and Bermudan options, such as Bermudan max-call options in up to 5000 dimensions. Most of the obtained results are compared to reference values computed by exploiting the specific problem design or, where available, to reference values from the literature. These numerical results suggest that the proposed algorithm is highly effective in the case of many underlyings, in terms of both accuracy and speed.

cs.CE

Deep splitting method for parabolic PDEs

In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational graph for each of the subproblems is comparatively small, the approach can handle extremely high-dimensional PDEs. We test the method on different examples from physics, stochastic control and mathematical finance. In all cases, it yields very good results in up to 10,000 dimensions with short run times.

math.NA

Lower and upper bounds for strong approximation errors for numerical approximations of stochastic heat equations

Optimal upper and lower error estimates for strong full-discrete numerical approximations of the stochastic heat equation driven by space-time white noise are obtained. In particular, we establish the optimality of strong convergence rates for full-discrete approximations of stochastic Allen-Cahn equations with space-time white noise which have recently been obtained in [Becker, S., Gess, B., Jentzen, A., and Kloeden, P. E., Strong convergence rates for explicit space-time discrete numerical approximations of stochastic Allen-Cahn equations. arXiv:1711.02423 (2017)].

math.PR

Solving the Kolmogorov PDE by means of deep learning

Stochastic differential equations (SDEs) and the Kolmogorov partial differential equations (PDEs) associated to them have been widely used in models from engineering, finance, and the natural sciences. In particular, SDEs and Kolmogorov PDEs, respectively, are highly employed in models for the approximative pricing of financial derivatives. Kolmogorov PDEs and SDEs, respectively, can typically not be solved explicitly and it has been and still is an active topic of research to design and analyze numerical methods which are able to approximately solve Kolmogorov PDEs and SDEs, respectively. Nearly all approximation methods for Kolmogorov PDEs in the literature suffer under the curse of dimensionality or only provide approximations of the solution of the PDE at a single fixed space-time point. In this paper we derive and propose a numerical approximation method which aims to overcome both of the above mentioned drawbacks and intends to deliver a numerical approximation of the Kolmogorov PDE on an entire region $[a,b]^d$ without suffering from the curse of dimensionality. Numerical results on examples including the heat equation, the Black-Scholes model, the stochastic Lorenz equation, and the Heston model suggest that the proposed approximation algorithm is quite effective in high dimensions in terms of both accuracy and speed.

math.NA

Deep optimal stopping

In this paper we develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples. As such, it is broadly applicable in situations where the underlying randomness can efficiently be simulated. We test the approach on three problems: the pricing of a Bermudan max-call option, the pricing of a callable multi barrier reverse convertible and the problem of optimally stopping a fractional Brownian motion. In all three cases it produces very accurate results in high-dimensional situations with short computing times.

math.NA

Strong convergence rates for explicit space-time discrete numerical approximations of stochastic Allen-Cahn equations

The scientific literature contains a number of numerical approximation results for stochastic partial differential equations (SPDEs) with superlinearly growing nonlinearities but, to the best of our knowledge, none of them prove strong or weak convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities. In particular, in the scientific literature there exists neither a result which proves strong convergence rates nor a result which proves weak convergence rates for full-discrete numerical approximations of stochastic Allen-Cahn equations. In this article we bridge this gap and establish strong convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities such as stochastic Allen-Cahn equations. Moreover, we also establish lower bounds for strong temporal and spatial approximation errors which demonstrate that our strong convergence rates are essentially sharp and can, in general, not be improved.

math.PR