default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Paudice
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Margin-Based Active Learning of Classifiers. J. Mach. Learn. Res. 25: 127:1-127:45 (2024)- [j6]Daniela Angela Parletta, Andrea Paudice
, Massimiliano Pontil, Saverio Salzo:
High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise]. SIAM J. Math. Data Sci. 6(4): 953-977 (2024) - 2022
- [j5]Nicolò Cesa-Bianchi, Pierre Laforgue, Andrea Paudice, Massimiliano Pontil:
Multitask Online Mirror Descent. Trans. Mach. Learn. Res. 2022 (2022) - 2019
- [j4]Domenico Cotroneo, Andrea Paudice, Antonio Pecchia:
Empirical Analysis and Validation of Security Alerts Filtering Techniques. IEEE Trans. Dependable Secur. Comput. 16(5): 856-870 (2019) - 2018
- [j3]Vittorio P. Illiano, Andrea Paudice, Luis Muñoz-González, Emil C. Lupu:
Determining Resilience Gains From Anomaly Detection for Event Integrity in Wireless Sensor Networks. ACM Trans. Sens. Networks 14(1): 5:1-5:35 (2018) - 2017
- [j2]Luis Muñoz-González, Daniele Sgandurra, Andrea Paudice, Emil C. Lupu:
Efficient Attack Graph Analysis through Approximate Inference. ACM Trans. Priv. Secur. 20(3): 10:1-10:30 (2017) - 2016
- [j1]Domenico Cotroneo, Andrea Paudice, Antonio Pecchia:
Automated root cause identification of security alerts: Evaluation in a SaaS Cloud. Future Gener. Comput. Syst. 56: 375-387 (2016)
Conference and Workshop Papers
- 2024
- [c10]Khaled Eldowa, Andrea Paudice:
General Tail Bounds for Non-Smooth Stochastic Mirror Descent. AISTATS 2024: 3205-3213 - 2022
- [c9]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. NeurIPS 2022 - 2021
- [c8]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. COLT 2021: 775-803 - [c7]Andreas Maurer, Daniela Angela Parletta, Andrea Paudice, Massimiliano Pontil:
Robust Unsupervised Learning via L-statistic Minimization. ICML 2021: 7524-7533 - [c6]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. NeurIPS 2021: 25231-25243 - 2020
- [c5]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. NeurIPS 2020 - 2019
- [c4]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. NeurIPS 2019: 12510-12519 - 2018
- [c3]Andrea Paudice, Luis Muñoz-González, Emil C. Lupu:
Label Sanitization Against Label Flipping Poisoning Attacks. Nemesis/UrbReas/SoGood/IWAISe/GDM@PKDD/ECML 2018: 5-15 - 2017
- [c2]Luis Muñoz-González, Battista Biggio, Ambra Demontis, Andrea Paudice, Vasin Wongrassamee, Emil C. Lupu, Fabio Roli:
Towards Poisoning of Deep Learning Algorithms with Back-gradient Optimization. AISec@CCS 2017: 27-38 - 2014
- [c1]Andrea Paudice, Santonu Sarkar, Domenico Cotroneo:
An Experiment with Conceptual Clustering for the Analysis of Security Alerts. ISSRE Workshops 2014: 335-340
Informal and Other Publications
- 2023
- [i15]Roberto Colomboni, Emmanuel Esposito, Andrea Paudice:
An Improved Uniform Convergence Bound with Fat-Shattering Dimension. CoRR abs/2307.06644 (2023) - [i14]Khaled Eldowa, Andrea Paudice:
General Tail Bounds for Non-Smooth Stochastic Mirror Descent. CoRR abs/2312.07142 (2023) - 2022
- [i13]François Bachoc, Tommaso Cesari, Roberto Colomboni, Andrea Paudice:
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization. CoRR abs/2208.06720 (2022) - [i12]François Bachoc, Tommaso Cesari, Roberto Colomboni, Andrea Paudice:
Regret Analysis of Dyadic Search. CoRR abs/2209.00885 (2022) - [i11]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. CoRR abs/2209.03996 (2022) - 2021
- [i10]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. CoRR abs/2102.00504 (2021) - [i9]Nicolò Cesa-Bianchi, Pierre Laforgue, Andrea Paudice, Massimiliano Pontil:
Multitask Online Mirror Descent. CoRR abs/2106.02393 (2021) - [i8]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. CoRR abs/2106.04913 (2021) - 2020
- [i7]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. CoRR abs/2006.04675 (2020) - [i6]Andreas Maurer, Daniela A. Parletta, Andrea Paudice, Massimiliano Pontil:
A Perturbation Resilient Framework for Unsupervised Learning. CoRR abs/2012.07399 (2020) - 2019
- [i5]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. CoRR abs/1905.11902 (2019) - 2018
- [i4]Andrea Paudice, Luis Muñoz-González, András György, Emil C. Lupu:
Detection of Adversarial Training Examples in Poisoning Attacks through Anomaly Detection. CoRR abs/1802.03041 (2018) - [i3]Andrea Paudice, Luis Muñoz-González, Emil C. Lupu:
Label Sanitization against Label Flipping Poisoning Attacks. CoRR abs/1803.00992 (2018) - 2017
- [i2]Luis Muñoz-González, Battista Biggio, Ambra Demontis, Andrea Paudice, Vasin Wongrassamee, Emil C. Lupu, Fabio Roli:
Towards Poisoning of Deep Learning Algorithms with Back-gradient Optimization. CoRR abs/1708.08689 (2017) - 2016
- [i1]Luis Muñoz-González, Daniele Sgandurra, Andrea Paudice, Emil C. Lupu:
Efficient Attack Graph Analysis through Approximate Inference. CoRR abs/1606.07025 (2016)
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-11-07 21:37 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:
