default search action
Francesco Alesiani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i17]Viktor Zaverkin, Francesco Alesiani, Takashi Maruyama, Federico Errica, Henrik Christiansen, Makoto Takamoto, Nicolas Weber, Mathias Niepert:
Higher-Rank Irreducible Cartesian Tensors for Equivariant Message Passing. CoRR abs/2405.14253 (2024) - [i16]Markus Zopf, Francesco Alesiani:
Graph Reasoning Networks. CoRR abs/2407.05816 (2024) - 2023
- [j4]Francesco Alesiani, Shujian Yu, Xi Yu:
Gated information bottleneck for generalization in sequential environments. Knowl. Inf. Syst. 65(2): 683-705 (2023) - [c21]Francesco Alesiani:
Implicit Bilevel Optimization: Differentiating through Bilevel Optimization Programming. AAAI 2023: 14683-14691 - [c20]Makoto Takamoto, Francesco Alesiani, Mathias Niepert:
Learning Neural PDE Solvers with Parameter-Guided Channel Attention. ICML 2023: 33448-33467 - [i15]Francesco Alesiani:
Implicit Bilevel Optimization: Differentiating through Bilevel Optimization Programming. CoRR abs/2302.14473 (2023) - [i14]Makoto Takamoto, Francesco Alesiani, Mathias Niepert:
Learning Neural PDE Solvers with Parameter-Guided Channel Attention. CoRR abs/2304.14118 (2023) - [i13]Henrik Christiansen, Federico Errica, Francesco Alesiani:
Self-Tuning Hamiltonian Monte Carlo for Accelerated Sampling. CoRR abs/2309.13593 (2023) - [i12]Francesco Alesiani, Shujian Yu, Mathias Niepert:
Continual Invariant Risk Minimization. CoRR abs/2310.13977 (2023) - [i11]Federico Errica, Henrik Christiansen, Viktor Zaverkin, Takashi Maruyama, Mathias Niepert, Francesco Alesiani:
Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching. CoRR abs/2312.16560 (2023) - 2022
- [j3]Francesco Alesiani, Gülcin Ermis, Konstantinos Gkiotsalitis:
Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP). Appl. Artif. Intell. 36(1) (2022) - [c19]Ammar Shaker, Francesco Alesiani, Shujian Yu:
Modular-Relatedness for Continual Learning. IDA 2022: 290-301 - [c18]Makoto Takamoto, Timothy Praditia, Raphael Leiteritz, Daniel MacKinlay, Francesco Alesiani, Dirk Pflüger, Mathias Niepert:
PDEBench: An Extensive Benchmark for Scientific Machine Learning. NeurIPS 2022 - [c17]Shujian Yu, Francesco Alesiani, Wenzhe Yin, Robert Jenssen, José C. Príncipe:
Principle of relevant information for graph sparsification. UAI 2022: 2331-2341 - [i10]Shujian Yu, Francesco Alesiani, Wenzhe Yin, Robert Jenssen, José C. Príncipe:
Principle of Relevant Information for Graph Sparsification. CoRR abs/2206.00118 (2022) - [i9]Bhushan Kotnis, Kiril Gashteovski, Julia Gastinger, Giuseppe Serra, Francesco Alesiani, Timo Sztyler, Ammar Shaker, Na Gong, Carolin Lawrence, Zhao Xu:
Human-Centric Research for NLP: Towards a Definition and Guiding Questions. CoRR abs/2207.04447 (2022) - [i8]Makoto Takamoto, Timothy Praditia, Raphael Leiteritz, Daniel MacKinlay, Francesco Alesiani, Dirk Pflüger, Mathias Niepert:
PDEBENCH: An Extensive Benchmark for Scientific Machine Learning. CoRR abs/2210.07182 (2022) - 2021
- [c16]Shujian Yu, Francesco Alesiani, Xi Yu, Robert Jenssen, José C. Príncipe:
Measuring Dependence with Matrix-based Entropy Functional. AAAI 2021: 10781-10789 - [c15]Francesco Alesiani, Shujian Yu, Xi Yu:
Gated Information Bottleneck for Generalization in Sequential Environments. ICDM 2021: 1-10 - [c14]Tobias Jacobs, Francesco Alesiani, Gülcin Ermis:
Reinforcement Learning for Route Optimization with Robustness Guarantees. IJCAI 2021: 2592-2598 - [c13]Ammar Shaker, Francesco Alesiani, Shujian Yu, Wenzhe Yin:
Bilevel Continual Learning. IJCNN 2021: 1-8 - [c12]Gülcin Ermis, Francesco Alesiani, Konstantinos Gkiotsalitis:
Optimization of Collection and Consolidation Operations in Cross-Border Multi-modal Distribution Networks. ITSC 2021: 1004-1010 - [i7]Shujian Yu, Francesco Alesiani, Xi Yu, Robert Jenssen, José C. Príncipe:
Measuring Dependence with Matrix-based Entropy Functional. CoRR abs/2101.10160 (2021) - [i6]Francesco Alesiani, Shujian Yu, Xi Yu:
Gated Information Bottleneck for Generalization in Sequential Environments. CoRR abs/2110.06057 (2021) - 2020
- [c11]Shujian Yu, Ammar Shaker, Francesco Alesiani, José C. Príncipe:
Measuring the Discrepancy between Conditional Distributions: Methods, Properties and Applications. IJCAI 2020: 2777-2784 - [c10]Francesco Alesiani, Shujian Yu, Ammar Shaker, Wenzhe Yin:
Towards Interpretable Multi-task Learning Using Bilevel Programming. ECML/PKDD (2) 2020: 593-608 - [i5]Shujian Yu, Ammar Shaker, Francesco Alesiani, José C. Príncipe:
Measuring the Discrepancy between Conditional Distributions: Methods, Properties and Applications. CoRR abs/2005.02196 (2020) - [i4]Francesco Alesiani, Shujian Yu, Ammar Shaker, Wenzhe Yin:
Towards Interpretable Multi-Task Learning Using Bilevel Programming. CoRR abs/2009.05483 (2020) - [i3]Shujian Yu, Francesco Alesiani, Ammar Shaker, Wenzhe Yin:
Learning an Interpretable Graph Structure in Multi-Task Learning. CoRR abs/2009.05618 (2020) - [i2]Ammar Shaker, Francesco Alesiani, Shujian Yu, Wenzhe Yin:
Bilevel Continual Learning. CoRR abs/2011.01168 (2020)
2010 – 2019
- 2019
- [c9]Xiao He, Francesco Alesiani, Ammar Shaker:
Efficient and Scalable Multi-Task Regression on Massive Number of Tasks. AAAI 2019: 3763-3770 - 2018
- [j2]Francesco Alesiani, Luís Moreira-Matias, Mahsa Faizrahnemoon:
On Learning From Inaccurate and Incomplete Traffic Flow Data. IEEE Trans. Intell. Transp. Syst. 19(11): 3698-3708 (2018) - [c8]Konstantinos Gkiotsalitis, Francesco Alesiani:
Reliable bus dispatching times by coupling Monte Carlo evaluations with a Genetic Algorithm. ITSC 2018: 926-932 - [c7]Francesco Alesiani, Konstantinos Gkiotsalitis:
Reinforcement Learning-Based Bus Holding for High-Frequency Services. ITSC 2018: 3162-3168 - [i1]Xiao He, Francesco Alesiani, Ammar Shaker:
Efficient and Scalable Multi-task Regression on Massive Number of Tasks. CoRR abs/1811.05695 (2018) - 2016
- [c6]Francesco Alesiani, Chairit Wuthishuwong:
Locally Growing Rapid Tree (LGRT) motion planning for autonomous driving. ITSC 2016: 1120-1125 - [c5]Francesco Alesiani, Sebastian Gajek:
Remote Testimony: How to Trust an Autonomous Vehicle. VTC Spring 2016: 1-5 - 2015
- [c4]Luís Moreira-Matias, Francesco Alesiani:
Drift3Flow: Freeway-Incident Prediction Using Real-Time Learning. ITSC 2015: 566-571 - 2014
- [j1]Francesco Alesiani, Nitin Maslekar:
Optimization of Charging Stops for Fleet of Electric Vehicles: A Genetic Approach. IEEE Intell. Transp. Syst. Mag. 6(3): 10-21 (2014) - [c3]Konstantinos Gkiotsalitis, Francesco Alesiani:
Opportunistic solution-space reduction techniques for reducing the time complexity of Dynamic Speed Control with microsimulation on motorways. ITSC 2014: 1788-1795
2000 – 2009
- 2003
- [c2]Francesco Alesiani, Alberto Tarable:
Differential space-time CDMA with turbo decoding. GLOBECOM 2003: 616-620 - 2001
- [c1]Francesco Alesiani, Ezio Biglieri, Giorgio Taricco, Emanuele Viterbo:
Performance of adaptive modulation techniques in the UMTS system. GLOBECOM 2001: 1272-1276
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-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint