Paul Fischer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paul Fischer has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Hans Ulrich Simon
Faculty of Mathematics Ruhr-University Bochum Germany
6 shared publications - Carsten Witt
Technical University of Denmark
5 shared publications - Nicolò Cesa-Bianchi
Università degli Studi di Milano Milan Italy
4 shared publications Eli Dichterman
IBM Haifa Research Lab, Haifa, Israel
2 shared publicationsEli Shamir
Hebrew Univ., Jerusalem, Israel
2 shared publications- Andreas Christmann
University of Bayreuth
1 shared publication
Latest Publications
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1560-1568
A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation
In the field of neuroevolution (NE), evolutionary algorithms are used to update the weights, biases and topologies of artificial neural networks (ANNs). A recent theoretical work presented the first runtime analysis of NE in a simple setting, considering a single neuron and intuitive benchmark function classes. However, this work was limited by the unrealistic settings with regard to activation functions and fitness measurements. In this paper, we extend upon this first work by overcoming the two shortcomings. Firstly, we consider a more realistic setting in which the NE also evolves a third parameter, termed the bend, allowing the previous benchmark function classes to be solved efficiently even in the fixed bias case. This setting mimics rectified linear unit activation functions, which are common in real-world applications of ANNs. Secondly, we consider a dynamic fitness function evaluation paradigm where the weights and biases are updated after each new sample. Experimental results in both cases support the presented theoretical results.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1560-1568
Open AccessA Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation
In the field of neuroevolution (NE), evolutionary algorithms are used to update the weights, biases and topologies of artificial neural networks (ANNs). A recent theoretical work presented the first runtime analysis of NE in a simple setting, considering a single neuron and intuitive benchmark function classes. However, this work was limited by the unrealistic settings with regard to activation functions and fitness measurements. In this paper, we extend upon this first work by overcoming the two shortcomings. Firstly, we consider a more realistic setting in which the NE also evolves a third parameter, termed the bend, allowing the previous benchmark function classes to be solved efficiently even in the fixed bias case. This setting mimics rectified linear unit activation functions, which are common in real-world applications of ANNs. Secondly, we consider a dynamic fitness function evaluation paradigm where the weights and biases are updated after each new sample. Experimental results in both cases support the presented theoretical results.
- Open Access
- 30 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 61-72
First Steps Towards a Runtime Analysis of Neuroevolution
- 30 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 61-72
Open AccessFirst Steps Towards a Runtime Analysis of Neuroevolution
- Open Access
Edge-matching Problems with Rotations
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity~II puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so far. We show that some problems have polynomial time algorithms while others are NP-complete. Especially we show that allowing rotations in one-row puzzles makes the problem NP-hard. The proofs of the hardness result uses a large number of colors. This is essential because we also show that this problem (and another related one) is fixed-parameter tractable, where the relevant parameter is the number of colors.
Open AccessEdge-matching Problems with Rotations
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity~II puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so far. We show that some problems have polynomial time algorithms while others are NP-complete. Especially we show that allowing rotations in one-row puzzles makes the problem NP-hard. The proofs of the hardness result uses a large number of colors. This is essential because we also show that this problem (and another related one) is fixed-parameter tractable, where the relevant parameter is the number of colors.
- 23 February 2016
- Published by Springer Nature in Soft Computing
- Vol. 21 (16) , 4707-4720
Detecting structural breaks in time series via genetic algorithms
- 23 February 2016
- Published by Springer Nature in Soft Computing
- Vol. 21 (16) , 4707-4720
Detecting structural breaks in time series via genetic algorithms
- 20 October 2014
- Published by Environmental Health Perspectives in ISEE Conference Abstracts
- Vol. 2014 (1)
Air Pollution and Mortality in the Netherlands; Stratified by Gender, Age and Social Status. The DUELS Study
Environmental Health Perspectives is an Open Access journal published by the National Institute of Environmental Health Sciences. Environmental Health Perspectives is an Open Access journal published by the National Institute of Environmental Health Sciences.
- 20 October 2014
- Published by Environmental Health Perspectives in ISEE Conference Abstracts
- Vol. 2014 (1)
Air Pollution and Mortality in the Netherlands; Stratified by Gender, Age and Social Status. The DUELS Study
Environmental Health Perspectives is an Open Access journal published by the National Institute of Environmental Health Sciences. Environmental Health Perspectives is an Open Access journal published by the National Institute of Environmental Health Sciences.
- 1 September 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 349-356
Load Scheduling in a Cloud Based Massive Video-Storage Environment
We propose an architecture for a storage system of surveillance videos. Such systems have to handle massive amounts of incoming video streams and relatively few requests for replay. In such a system load (i.e., Write requests) scheduling is essential to guarantee performance. Large-scale data-storage system (LSDSS) is an emerging hosting facility for video-storage, which has a very high number of writes while most of the videos are never or rarely watched. We discuss the design and implementation of LSDSS and load scheduling in autonomous storage environments called datacenters in LSDSS. A datacenter (DC) is the basic concept in our LSDSS, which has the self-management system to store data efficiently. A LSDSS consists of many DCs organized in a hierarchy fashion, thereby decentralizing load scheduling tasks. Because DC has a simple design, load scheduling is particularly suited for implementation on a real-time video surveillance and allows to make scheduling decisions. We also discuss experimental results that clearly show the advantage of load scheduling over the widely known base load scheduling.
- 1 September 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 349-356
Load Scheduling in a Cloud Based Massive Video-Storage Environment
We propose an architecture for a storage system of surveillance videos. Such systems have to handle massive amounts of incoming video streams and relatively few requests for replay. In such a system load (i.e., Write requests) scheduling is essential to guarantee performance. Large-scale data-storage system (LSDSS) is an emerging hosting facility for video-storage, which has a very high number of writes while most of the videos are never or rarely watched. We discuss the design and implementation of LSDSS and load scheduling in autonomous storage environments called datacenters in LSDSS. A datacenter (DC) is the basic concept in our LSDSS, which has the self-management system to store data efficiently. A LSDSS consists of many DCs organized in a hierarchy fashion, thereby decentralizing load scheduling tasks. Because DC has a simple design, load scheduling is particularly suited for implementation on a real-time video surveillance and allows to make scheduling decisions. We also discuss experimental results that clearly show the advantage of load scheduling over the widely known base load scheduling.
- Open Access
- 6 July 2013
- Published by Association for Computing Machinery (ACM)
- p. 119-120
Evolutionary algorithms for the detection of structural breaks in time series
Detecting structural breaks is an essential task for the statistical analysis of time series, for example, for fitting parametric models to it. In short, structural breaks are points in time at which the behavior of the time series changes. Typically, no solid background knowledge of the time series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a evolutionary algorithm framework which easily adapts to a large number of statistical settings. The experiments on artificial and real-world time series show that the algorithm detects break points with high precision and is computationally very efficient. A reference implementation is availble at the following address: http://www2.imm.dtu.dk/~pafi/SBX/launch.html}
- 6 July 2013
- Published by Association for Computing Machinery (ACM)
- p. 119-120
Open AccessEvolutionary algorithms for the detection of structural breaks in time series
Detecting structural breaks is an essential task for the statistical analysis of time series, for example, for fitting parametric models to it. In short, structural breaks are points in time at which the behavior of the time series changes. Typically, no solid background knowledge of the time series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a evolutionary algorithm framework which easily adapts to a large number of statistical settings. The experiments on artificial and real-world time series show that the algorithm detects break points with high precision and is computationally very efficient. A reference implementation is availble at the following address: http://www2.imm.dtu.dk/~pafi/SBX/launch.html}
- 1 January 2008
- Published by INSTICC
- p. 45-52
FAULTS ANALYSIS IN DISTRIBUTED SYSTEMS - Quantitative Estimation of Reliability and Resource Requirements
We live in a time where we become ever more dependent on distributed computing. Predictable quantitative properties of reliability and resource requirements of these systems are of outmost importance. But today quantitative properties of these systems can only be established after the systems are implemented and released for test, at which point problems can be costly and time consuming to solve. We present a new method, a process algebra and simulation tool for estimating quantitative properties of reliability and resource requirements of a distributed system with complex behaviour hereunder complex fault-tolerance behaviour. The simulation tool allows tailored fault injection e.g. random failure and attacks. The method is based upon π-calculus (Milner, 1999) to which it adds a stochastic fail-able process group construct. Performance is quantitatively estimated using reaction rates (Priami, 1995). We show how to model and estimate quantitative properties of a CPU scavenging grid wit
- 1 January 2008
- Published by INSTICC
- p. 45-52
FAULTS ANALYSIS IN DISTRIBUTED SYSTEMS - Quantitative Estimation of Reliability and Resource Requirements
We live in a time where we become ever more dependent on distributed computing. Predictable quantitative properties of reliability and resource requirements of these systems are of outmost importance. But today quantitative properties of these systems can only be established after the systems are implemented and released for test, at which point problems can be costly and time consuming to solve. We present a new method, a process algebra and simulation tool for estimating quantitative properties of reliability and resource requirements of a distributed system with complex behaviour hereunder complex fault-tolerance behaviour. The simulation tool allows tailored fault injection e.g. random failure and attacks. The method is based upon π-calculus (Milner, 1999) to which it adds a stochastic fail-able process group construct. Performance is quantitatively estimated using reaction rates (Priami, 1995). We show how to model and estimate quantitative properties of a CPU scavenging grid wit
- 17 October 2005
- Published by Springer Nature
- p. 27-33
Predicting Protein Secondary Structure with Markov Models
- 17 October 2005
- Published by Springer Nature
- p. 27-33
Predicting Protein Secondary Structure with Markov Models
- 1 October 2004
- Published by Elsevier in Theoretical Computer Science
- Vol. 326 (1-3) , 383-398
The complexity of computing the MCD-estimator
- 1 October 2004
- Published by Elsevier in Theoretical Computer Science
- Vol. 326 (1-3) , 383-398
The complexity of computing the MCD-estimator