Francesco Quinzan

Affiliations:
  • Hasso Plattner Institute, Potsdam, Germany


According to our database1, Francesco Quinzan authored at least 18 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Combinatorial problems and scalability in artificial intelligence
PhD thesis, 2023

Doubly Robust Structure Identification from Temporal Data.
CoRR, 2023

Diffusion Based Causal Representation Learning.
CoRR, 2023

DRCFS: Doubly Robust Causal Feature Selection.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Transport for Correctional Learning.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

Fast Feature Selection with Fairness Constraints.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Learning Counterfactually Invariant Predictors.
CoRR, 2022

2021
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations.
Nat. Comput., 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Function.
CoRR, 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Functions.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Escaping large deceptive basins of attraction with heavy-tailed mutation operators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Approximating optimization problems using EAs on scale-free networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Resampling vs Recombination: a Statistical Run Time Estimation.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

2016
Ant Colony Optimization Beats Resampling on Noisy Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016


  Loading...