Browsing by Author "Pflüger, Dirk"

Now showing 1 - 3 of 3

Open Access
Effective or predatory funding? : evaluating the hidden costs of grant applications
(2022) Dresler, Martin; Buddeberg, Eva; Endesfelder, Ulrike; Haaker, Jan; Hof, Christian; Kretschmer, Robert; Pflüger, Dirk; Schmidt, Fabian
Researchers are spending an increasing fraction of their time on applying for funding; however, the current funding system has considerable deficiencies in reliably evaluating the merit of research proposals, despite extensive efforts on the sides of applicants, grant reviewers and decision committees. For some funding schemes, the systemic costs of the application process as a whole can even outweigh the granted resources - a phenomenon that could be considered as predatory funding. We present five recommendations to remedy this unsatisfactory situation.
Open Access
Research data management in simulation science : infrastructure, tools, and applications
(2024) Flemisch, Bernd; Hermann, Sibylle; Herschel, Melanie; Pflüger, Dirk; Pleiss, Jürgen; Range, Jan; Roy, Sarbani; Takamoto, Makoto; Uekermann, Benjamin
Research Data Management (RDM) has gained significant traction in recent years, being essential to allowing research data to be, e.g., findable, accessible, interoperable, and reproducible (FAIR), thereby fostering collaboration or accelerating scientific findings. We present solutions for RDM developed within the DFG-Funded Cluster of Excellence EXC2075 Data-Integrated Simulation Science (SimTech). After an introduction to the scientific context and challenges faced by simulation scientists, we outline the general data management infrastructure and present tools that address these challenges. Exemplary domain applications demonstrate the use and benefits of the proposed data management software solutions. These are complemented by additional measures for enablement and dissemination to foster the adoption of these techniques.
Open Access
Solving high-dimensional dynamic portfolio choice models with hierarchical B-splines on sparse grids
(2021) Schober, Peter; Valentin, Julian; Pflüger, Dirk
Discrete time dynamic programming to solve dynamic portfolio choice models has three immanent issues: firstly, the curse of dimensionality prohibits more than a handful of continuous states. Secondly, in higher dimensions, even regular sparse grid discretizations need too many grid points for sufficiently accurate approximations of the value function. Thirdly, the models usually require continuous control variables, and hence gradient-based optimization with smooth approximations of the value function is necessary to obtain accurate solutions to the optimization problem. For the first time, we enable accurate and fast numerical solutions with gradient-based optimization while still allowing for spatial adaptivity using hierarchical B-splines on sparse grids. When compared to the standard linear bases on sparse grids or finite difference approximations of the gradient, our approach saves an order of magnitude in total computational complexity for a representative dynamic portfolio choice model with varying state space dimensionality, stochastic sample space, and choice variables.