Claudio Gentile

According to our database1, Claudio Gentile authored at least 125 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Batch Active Learning at Scale.
CoRR, 2021

On Learning to Rank Long Sequences with Contextual Bandits.
CoRR, 2021

Neural Active Learning with Performance Guarantees.
CoRR, 2021

Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees.
Proceedings of the 38th International Conference on Machine Learning, 2021

Dynamic Balancing for Model Selection in Bandits and RL.
Proceedings of the 38th International Conference on Machine Learning, 2021

Best Model Identification: A Rested Bandit Formulation.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs.
Math. Oper. Res., 2020

Transient-Based Internet of Things Emitter Identification Using Convolutional Neural Networks and Optimized General Linear Chirplet Transform.
IEEE Commun. Lett., 2020

Regret Bound Balancing and Elimination for Model Selection in Bandits and RL.
CoRR, 2020

Online Model Selection: a Rested Bandit Formulation.
CoRR, 2020

Mathematical programming formulations for the alternating current optimal power flow problem.
4OR, 2020

Adapting to Misspecification in Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Learning with Dependent Stochastic Feedback Graphs.
Proceedings of the 37th International Conference on Machine Learning, 2020

Adaptive Region-Based Active Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Strengthening the sequential convex MINLP technique by perspective reformulations.
Optim. Lett., 2019

Delay and Cooperation in Nonstochastic Bandits.
J. Mach. Learn. Res., 2019

Flattening a Hierarchical Clustering through Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Active Learning with Disagreement Graphs.
Proceedings of the 36th International Conference on Machine Learning, 2019

Online Learning with Sleeping Experts and Feedback Graphs.
Proceedings of the 36th International Conference on Machine Learning, 2019

An assessment of the impact of IQ imbalances on the physical layer authentication of IoT wireless devices.
Proceedings of the 2019 Global IoT Summit, 2019

Region-Based Active Learning.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Special Issue on ALT 2015: Guest Editors' Introduction.
Theor. Comput. Sci., 2018

Measures to Address the Lack of Portability of the RF Fingerprints for Radiometric Identification.
Proceedings of the 9th IFIP International Conference on New Technologies, 2018

Online Reciprocal Recommendation with Theoretical Performance Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Online Learning with Abstention.
Proceedings of the 35th International Conference on Machine Learning, 2018

Nonstochastic Bandits with Composite Anonymous Feedback.
Proceedings of the Conference On Learning Theory, 2018

On Similarity Prediction and Pairwise Clustering.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback.
SIAM J. Comput., 2017

Identification of Mobile Phones Using the Built-In Magnetometers Stimulated by Motion Patterns.
Sensors, 2017

Improving the Approximated Projected Perspective Reformulation by dual information.
Oper. Res. Lett., 2017

A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints.
EURO J. Comput. Optim., 2017

On Pairwise Clustering with Side Information.
CoRR, 2017

Online Nonparametric Learning, Chaining, and the Role of Partial Feedback.
CoRR, 2017

The application of the Symbolic Aggregate Approximation algorithm (SAX) to radio frequency fingerprinting of IoT devices.
Proceedings of the 24. IEEE Symposium on Communications and Vehicular Technology, 2017

Boltzmann Exploration Done Right.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

On Context-Dependent Clustering of Bandits.
Proceedings of the 34th International Conference on Machine Learning, 2017

Imaging time series for internet of things radio frequency fingerprinting.
Proceedings of the International Carnahan Conference on Security Technology, 2017

Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning.
Proceedings of the 30th Conference on Learning Theory, 2017

On the Troll-Trust Model for Edge Sign Prediction in Social Networks.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
The stable set polytope of icosahedral graphs.
Discret. Math., 2016

Online Context-Dependent Clustering in Recommendations based on Exploration-Exploitation Algorithms.
CoRR, 2016

Graph Clustering Bandits for Recommendation.
CoRR, 2016

Approximated perspective relaxations: a project and lift approach.
Comput. Optim. Appl., 2016

Collaborative Filtering Bandits.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Delay and Cooperation in Nonstochastic Bandits.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Regret Minimization for Reserve Prices in Second-Price Auctions.
IEEE Trans. Inf. Theory, 2015

Tight MIP formulations of the power-based unit commitment problem.
OR Spectr., 2015

Data-Dependent Clustering in Exploration-Exploitation Algorithms.
CoRR, 2015

2014
On multilabel classification and ranking with bandit feedback.
J. Mach. Learn. Res., 2014

The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect.
J. Comb. Theory, Ser. B, 2014

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect.
J. Comb. Theory, Ser. B, 2014

Perspective Reformulations of the CTA Problem with L2 Distances.
Oper. Res., 2014

Online Clustering of Bandits.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Multiclass classification with bandit feedback using adaptive regularization.
Mach. Learn., 2013

Random spanning trees and the prediction ofweighted graphs.
J. Mach. Learn. Res., 2013

22-clique-bond of stable set polyhedra.
Discret. Appl. Math., 2013

A Gang of Bandits.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

From Bandits to Experts: A Tale of Domination and Independence.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Regret Minimization for Branching Experts.
Proceedings of the COLT 2013, 2013

Online Similarity Prediction of Networked Data from Known and Unknown Graphs.
Proceedings of the COLT 2013, 2013

2012
Beyond Logarithmic Bounds in Online Learning.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Selective sampling and active learning from single and multiple teachers.
J. Mach. Learn. Res., 2012

A Correlation Clustering Approach to Link Classification in Signed Networks.
Proceedings of the COLT 2012, 2012

On Multilabel Classification and Ranking with Partial Feedback.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

A Linear Time Active Learning Algorithm for Link Classification.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Predicting the labels of an unknown graph via adaptive exploration.
Theor. Comput. Sci., 2011

Learning noisy linear classifiers via adaptive and selective sampling.
Mach. Learn., 2011

Projected Perspective Reformulations with Applications in Design Problems.
Oper. Res., 2011

Bandits with an Edge
CoRR, 2011

The stable set polytope of claw-free graphs with stability number greater than three.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

See the Tree Through the Lines: The Shazoo Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Linear Algorithms for Online Multitask Classification.
J. Mach. Learn. Res., 2010

The stable set polytope of claw-free graphs with large stability number.
Electron. Notes Discret. Math., 2010

Random Spanning Trees and the Prediction of Weighted Graphs.
Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

Robust Selective Sampling from Single and Multiple Teachers.
Proceedings of the COLT 2010, 2010

Active Learning on Trees and Graphs.
Proceedings of the COLT 2010, 2010

2009
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.
Oper. Res. Lett., 2009

Gear Composition of Stable Set Polytopes and G-Perfection.
Math. Oper. Res., 2009

Robust bounds for classification via selective sampling.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Fast and Optimal Prediction on a Labeled Tree.
Proceedings of the COLT 2009, 2009

The k-Gear Composition and the Stable Set Polytope.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Learning Unknown Graphs.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Improved Risk Tail Bounds for On-Line Algorithms.
IEEE Trans. Inf. Theory, 2008

Gear composition and the stable set polytope.
Oper. Res. Lett., 2008

Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007).
Mach. Learn., 2008

Linear Classification and Selective Sampling Under Low Noise Conditions.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

An Evaluation of Function Point Counting Based on Measurement-Oriented Models.
Proceedings of the 12th International Conference on Evaluation and Assessment in Software Engineering, 2008

On the Stable Set Polytope of Claw-Free Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP.
Oper. Res. Lett., 2007

Experiments with a hybrid interior point/combinatorial approach for network flow problems.
Optim. Methods Softw., 2007

Tracking the best hyperplane with a simple budget Perceptron.
Mach. Learn., 2007

Prim-based support-graph preconditioners for min-cost flow problems.
Comput. Optim. Appl., 2007

On higher-order perceptron algorithms.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.
SIAM J. Discret. Math., 2006

Perspective cuts for a class of convex 0-1 mixed integer programs.
Math. Program., 2006

Worst-Case Analysis of Selective Sampling for Linear Classification.
J. Mach. Learn. Res., 2006

Incremental Algorithms for Hierarchical Classification.
J. Mach. Learn. Res., 2006

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints.
Oper. Res., 2006

Hierarchical classification: combining Bayes with SVM.
Proceedings of the Machine Learning, 2006

Tracking the Best Hyperplane with a Simple Budget Perceptron.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005
A Second-Order Perceptron Algorithm.
SIAM J. Comput., 2005

2004
On the Generalization Ability of On-Line Learning Algorithms.
IEEE Trans. Inf. Theory, 2004

New Preconditioners for KKT Systems of Network Flow Problems.
SIAM J. Optim., 2004

A Polyhedral Approach for the Staff Rostering Problem.
Manag. Sci., 2004

Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Incremental Algorithms for Hierarchical Classification.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Regret Bounds for Hierarchical Classification with Linear-Threshold Functions.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.
Proceedings of the Sharpest Cut, 2004

2003
The Robustness of the p-Norm Algorithms.
Mach. Learn., 2003

Guest Editor's Introduction.
Mach. Learn., 2003

Zero-Lifting for Integer Block Structured Problems.
J. Comb. Optim., 2003

Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002
Adaptive and Self-Confident On-Line Learning Algorithms.
J. Comput. Syst. Sci., 2002

Kernel Methods for Document Filtering.
Proceedings of The Eleventh Text REtrieval Conference, 2002

Margin-Based Algorithms for Information Filtering.
Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

A Primal Approach to the Stable Set Problem.
Proceedings of the Algorithms, 2002

2001
A New Approximate Maximal Margin Classification Algorithm.
J. Mach. Learn. Res., 2001

Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach.
Inf. Comput., 2001

2000
P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration.
Theor. Comput. Sci., 2000

Adaptive and Self-Confident On-Line Learning Algorithms.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999
The Robustness of the <i>p</i>-Norm Algorithms.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory.
Theor. Comput. Sci., 1998

Max Horn SAT and the minimum cut problem in directed hypergraphs.
Math. Program., 1998

Linear Hinge Loss and Average Margin.
Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998


  Loading...