default search action
Francesco Quinzan
Person information
- affiliation: Hasso Plattner Institute, Potsdam, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Amir Mohammad Karimi-Mamaghan
, Andrea Dittadi, Stefan Bauer, Karl Henrik Johansson, Francesco Quinzan:
Diffusion-Based Causal Representation Learning. Entropy 26(7): 556 (2024) - [j2]Francesco Quinzan, Cecilia Casolo, Krikamol Muandet, Yucen Luo, Niki Kilbertus:
Learning Counterfactually Invariant Predictors. Trans. Mach. Learn. Res. 2024 (2024) - [c13]Daqian Shao, Ashkan Soleymani, Francesco Quinzan, Marta Kwiatkowska:
Learning Decision Policies with Instrumental Variables through Double Machine Learning. ICML 2024 - [i12]Daqian Shao, Ashkan Soleymani, Francesco Quinzan, Marta Kwiatkowska:
Learning Decision Policies with Instrumental Variables through Double Machine Learning. CoRR abs/2405.08498 (2024) - 2023
- [b1]Francesco Quinzan:
Combinatorial problems and scalability in artificial intelligence. University of Potsdam, Germany, 2023 - [c12]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. AISTATS 2023: 7800-7823 - [c11]Rebecka Winqvist, Inês Lourenço, Francesco Quinzan, Cristian R. Rojas, Bo Wahlberg:
Optimal Transport for Correctional Learning. CDC 2023: 6806-6812 - [c10]Francesco Quinzan, Ashkan Soleymani, Patrick Jaillet, Cristian R. Rojas, Stefan Bauer:
DRCFS: Doubly Robust Causal Feature Selection. ICML 2023: 28468-28491 - [i11]Rebecka Winqvist, Inês Lourenço, Francesco Quinzan, Cristian R. Rojas, Bo Wahlberg:
Optimal Transport for Correctional Learning. CoRR abs/2304.01701 (2023) - [i10]Francesco Quinzan, Ashkan Soleymani, Patrick Jaillet, Cristian R. Rojas, Stefan Bauer:
DRCFS: Doubly Robust Causal Feature Selection. CoRR abs/2306.07024 (2023) - [i9]Amir Mohammad Karimi-Mamaghan, Andrea Dittadi, Stefan Bauer, Karl Henrik Johansson, Francesco Quinzan:
Diffusion Based Causal Representation Learning. CoRR abs/2311.05421 (2023) - [i8]Emmanouil Angelis, Francesco Quinzan, Ashkan Soleymani, Patrick Jaillet, Stefan Bauer:
Doubly Robust Structure Identification from Temporal Data. CoRR abs/2311.06012 (2023) - 2022
- [i7]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. CoRR abs/2202.13718 (2022) - [i6]Francesco Quinzan, Cecilia Casolo, Krikamol Muandet
Learning Counterfactually Invariant Predictors. CoRR abs/2207.09768 (2022) - 2021
- [j1]Francesco Quinzan, Andreas Göbel, Markus Wagner
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20(3): 561-575 (2021) - [c9]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS 2021: 964-972 - [i5]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR abs/2102.06486 (2021) - 2020
- [c8]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI 2020: 435-442
2010 – 2019
- 2019
- [c7]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI 2019: 2272-2279 - [i4]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR abs/1911.06791 (2019) - 2018
- [c6]Tobias Friedrich, Francesco Quinzan, Markus Wagner
Escaping large deceptive basins of attraction with heavy-tailed mutation operators. GECCO 2018: 293-300 - [c5]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO 2018: 301-308 - [c4]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) 2018: 134-145 - [i3]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs/1805.10902 (2018) - [i2]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR abs/1811.05351 (2018) - 2017
- [c3]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - [c2]Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating optimization problems using EAs on scale-free networks. GECCO 2017: 235-242 - [i1]Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating Optimization Problems using EAs on Scale-Free Networks. CoRR abs/1704.03664 (2017) - 2016
- [c1]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) 2016: 3-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-09-04 00:25 CEST 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: