default search action
Florian Schäfer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Spencer H. Bryngelson, Florian Schäfer, Jessie Liu, Ali Mani:
Fast macroscopic forcing method. J. Comput. Phys. 499: 112721 (2024) - [j12]Florian Schäfer, Houman Owhadi
:
Sparse Recovery of Elliptic Solvers from Matrix-Vector Products. SIAM J. Sci. Comput. 46(2): 998- (2024) - [j11]Jiong Chen
Lightning-fast Method of Fundamental Solutions. ACM Trans. Graph. 43(4): 77:1-77:16 (2024) - 2023
- [j10]Achim Guldner, Maximilian Hoffmann
A framework for AI-based self-adaptive cyber-physical process systems. it Inf. Technol. 65(3): 113-128 (2023) - [c12]Qi Zeng, Yash Kothari, Spencer H. Bryngelson, Florian Schäfer
Competitive Physics Informed Networks. ICLR 2023 - [i18]Jian Cao, Myeongjong Kang, Felix Jimenez, Huiyan Sang, Florian Schäfer, Matthias Katzfuss:
Variational sparse inverse Cholesky approximation for latent Gaussian processes via double Kullback-Leibler minimization. CoRR abs/2301.13303 (2023) - [i17]Yifan Chen, Houman Owhadi, Florian Schäfer:
Sparse Cholesky Factorization for Solving Nonlinear PDEs via Gaussian Processes. CoRR abs/2304.01294 (2023) - [i16]Jiawei Zhao, Yifei Zhang, Beidi Chen, Florian Schäfer, Anima Anandkumar:
InRank: Incremental Low-Rank Learning. CoRR abs/2306.11250 (2023) - [i15]Stephen Huan
Sparse Cholesky factorization by greedy conditional selection. CoRR abs/2307.11648 (2023) - [i14]Ruijia Cao, Florian Schäfer:
Information geometric regularization of the barotropic Euler equation. CoRR abs/2308.14127 (2023) - 2022
- [j9]Jiawei Zhao, Florian Schäfer, Anima Anandkumar:
ZerO Initialization: Initializing Neural Networks with only Zeros and Ones. Trans. Mach. Learn. Res. 2022 (2022) - [d1]Florian Schäfer
Benchmark Dataset for the Paper "A Hybrid Optimization Method Combining Network Expansion Planning and Switching State Optimization". IEEE DataPort, 2022 - [i13]Qi Zeng, Spencer H. Bryngelson
Competitive Physics Informed Networks. CoRR abs/2204.11144 (2022) - 2021
- [j8]Florian Schäfer
Compression, Inversion, and Approximate PCA of Dense Kernel Matrices at Near-Linear Computational Complexity. Multiscale Model. Simul. 19(2): 688-730 (2021) - [j7]Florian Schäfer, Matthias Katzfuss
Sparse Cholesky Factorization by Kullback-Leibler Minimization. SIAM J. Sci. Comput. 43(3): A2019-A2046 (2021) - [j6]Jiong Chen, Florian Schäfer, Jin Huang, Mathieu Desbrun:
Multiscale cholesky preconditioning for ill-conditioned problems. ACM Trans. Graph. 40(4): 81:1-81:13 (2021) - [c11]Jing Yu, Clement Gehring, Florian Schäfer
Robust Reinforcement Learning: A Constrained Game-theoretic Approach. L4DC 2021: 1242-1254 - [i12]Florian Schäfer, Houman Owhadi:
Sparse recovery of elliptic solvers from matrix-vector products. CoRR abs/2110.05351 (2021) - [i11]Jiawei Zhao, Florian Schäfer, Anima Anandkumar:
ZerO Initialization: Initializing Residual Networks with only Zeros and Ones. CoRR abs/2110.12661 (2021) - [i10]Jeffrey Ma, Alistair Letcher, Florian Schäfer, Yuanyuan Shi, Anima Anandkumar:
Polymatrix Competitive Gradient Descent. CoRR abs/2111.08565 (2021) - 2020
- [c10]Florian Schäfer, Hongkai Zheng, Animashree Anandkumar:
Implicit competitive regularization in GANs. ICML 2020: 8533-8544 - [i9]Florian Schäfer, Jan-Hendrik Menke, Martin Braun:
Comparison of Meta-Heuristics for the Planning of Meshed Power Systems. CoRR abs/2002.03619 (2020) - [i8]Florian Schäfer, Matthias Katzfuss, Houman Owhadi:
Sparse Cholesky factorization by Kullback-Leibler minimization. CoRR abs/2004.14455 (2020) - [i7]Florian Schäfer, Anima Anandkumar, Houman Owhadi:
Competitive Mirror Descent. CoRR abs/2006.10179 (2020) - [i6]Florian Schäfer, Jan-Hendrik Menke, Martin Braun:
Evaluating Machine Learning Models for the Fast Identification of Contingency Cases. CoRR abs/2008.09384 (2020)
2010 – 2019
- 2019
- [j5]Ya Bi, Mei Xiang, Florian Schäfer, Alan Lebwohl, Cunfa Wang:
A simplified and efficient particle swarm optimization algorithm considering particle diversity. Clust. Comput. 22(6): 13273-13282 (2019) - [j4]Qingfu Zhang, Houman Owhadi, Jun Yao
Multiresolution operator decomposition for flow simulation in fractured porous media. J. Comput. Phys. 391: 381-396 (2019) - [c9]Florian Schäfer, Anima Anandkumar:
Competitive Gradient Descent. NeurIPS 2019: 7623-7633 - [i5]Florian Schäfer, Anima Anandkumar:
Competitive Gradient Descent. CoRR abs/1905.12103 (2019) - [i4]Florian Schäfer, Hongkai Zheng, Anima Anandkumar:
Implicit competitive regularization in GANs. CoRR abs/1910.05852 (2019) - 2018
- [j3]Alexander Effland
Image Extrapolation for the Time Discrete Metamorphosis Model: Existence and Applications. SIAM J. Imaging Sci. 11(1): 834-862 (2018) - [c8]Florian Schäfer, Martin Braun
An efficient open-source implementation to compute the jacobian matrix for the Newton-Raphson power flow algorithm. ISGT Europe 2018: 1-6 - [c7]Jan-Hendrik Menke, Florian Schäfer, Martin Braun
Performing a Virtual Field Test of a New Monitoring Method for Smart Power Grids. SmartGridComm 2018: 1-7 - [c6]Florian Schäfer, Jan-Hendrik Menke, Martin Braun
Contingency Analysis of Power Systems with Artificial Neural Networks. SmartGridComm 2018: 1-6 - [i3]Florian Schäfer, Martin Braun:
An efficient open-source implementation to compute the Jacobian matrix for the Newton-Raphson power flow algorithm. CoRR abs/1804.06742 (2018) - 2017
- [c5]Viktor Botev, Kaloyan Marinov, Florian Schäfer:
Word importance-based similarity of documents metric (WISDM): Fast and scalable document similarity metric for analysis of scientific documents. WOSP@JCDL 2017: 17-23 - [c4]Alexander Effland
Time Discrete Extrapolation in a Riemannian Space of Images. SSVM 2017: 473-485 - [i2]Florian Schäfer, Timothy John Sullivan, Houman Owhadi:
Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity. CoRR abs/1706.02205 (2017) - [i1]Leon Thurner, Alexander Scheidler, Florian Schäfer, Jan-Hendrik Menke, Julian Dollichon, Friederike Meier, Steffen Meinecke, Martin Braun:
Pandapower - an Open Source Python Tool for Convenient Modeling, Analysis and Optimization of Electric Power Systems. CoRR abs/1709.06743 (2017) - 2013
- [j2]Luciano Lavagno, Mihai T. Lazarescu
HEAP: A Highly Efficient Adaptive multi-Processor framework. Microprocess. Microsystems 37(8-C): 1050-1062 (2013) - 2012
- [c3]Iakovos Mavroidis
FASTCUDA: Open Source FPGA Accelerator & Hardware-Software Codesign Toolset for CUDA Kernels. DSD 2012: 343-348 - [c2]Luciano Lavagno, Mihai T. Lazarescu
HEAP: A Highly Efficient Adaptive Multi-processor Framework. DSD 2012: 509-516
2000 – 2009
- 2009
- [j1]Florian Schäfer:
The Causative Alternation. Lang. Linguistics Compass 3(2): 641-681 (2009) - [c1]Markus Winterholer, Florian Schäfer:
Reuse of a HW/SW coverification environment during the refinement process of a functional C model down to an executable HW/SW specification. FDL 2009: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-17 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: