Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Antoine Salomon

dblp:06/10259 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2020
0009-0004-7911-4605ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 70% Learning theory · 30%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
multi-armed bandit
0.212013
Lower bounds and selectivity of weak-consistent policies in stochastic multi-armed bandit problem · J. Mach. Learn. Res. 2013
Machine learning › Learning theory › online learning › regret bounds
regret lower bounds
0.212013
Lower bounds and selectivity of weak-consistent policies in stochastic multi-armed bandit problem · J. Mach. Learn. Res. 2013
Machine learning › Reinforcement learning › multi-armed bandit
stochastic bandit
0.212013
Lower bounds and selectivity of weak-consistent policies in stochastic multi-armed bandit problem · J. Mach. Learn. Res. 2013
Machine learning › Reinforcement learning › exploration
exploration strategies
0.012013
Lower bounds and selectivity of weak-consistent policies in stochastic multi-armed bandit problem · J. Mach. Learn. Res. 2013

Methods — techniques the papers use, named apart from their topics

non-parametric change-point detection · 0.4monte carlo simulation · 0.4weak-consistent policy · 0.2
YearPublicationVenuePosition
2020 Dense Mapping of Intracellular Diffusion and Drift from Single-Particle Tracking Data Analysis
abstract
It is of primary interest for biologists to be able to visualize the dynamics of proteins within the cell. In this paper, we propose a new mapping method to robustly estimate dynamics in the entire cell from particle tracks. To obtain satisfying diffusion and drift maps, we use a spatiotemporal kernel estimator. Trajectory classification data is used as input and allows to automatically label particle movements into three classes: confined motion (or subdiffusion), Brownian motion, and directed motion (or superdiffusion). We then use this information to calculate diffusion coefficient and drift maps separately on each class of motion.
Antoine Salomon, Cesar Augusto Valades-Cruz, Ludovic Leconte, Charles Kervrann
ICASSP1
2020 A sequential algorithm to detect diffusion switching along intracellular particle trajectories
abstract
MOTIVATION: Recent advances in molecular biology and fluorescence microscopy imaging have made possible the inference of the dynamics of single molecules in living cells. Changes of dynamics can occur along a trajectory. Then, an issue is to estimate the temporal change-points that is the times at which a change of dynamics occurs. The number of points in the trajectory required to detect such changes will depend on both the magnitude and type of the motion changes. Here, the number of points per trajectory is of the order of 102, even if in practice dramatic motion changes can be detected with less points. RESULTS: We propose a non-parametric procedure based on test statistics computed on local windows along the trajectory to detect the change-points. This algorithm controls the number of false change-point detections in the case where the trajectory is fully Brownian. We also develop a strategy for aggregating the detections obtained with different window sizes so that the window size is no longer a parameter to optimize. A Monte Carlo study is proposed to demonstrate the performances of the method and also to compare the procedure to two competitive algorithms. At the end, we illustrate the efficacy of the method on real data in 2D and 3D, depicting the motion of mRNA complexes-called mRNA-binding proteins-in neuronal dendrites, Galectin-3 endocytosis and trafficking within the cell. AVAILABILITY AND IMPLEMENTATION: A user-friendly Matlab package containing examples and the code of the simulations used in the paper is available at http://serpico.rennes.inria.fr/doku.php? id=software:cpanalysis:index. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Vincent Briane, Myriam Vimond, Cesar Augusto Valades-Cruz, Antoine Salomon, Christian Wunder, Charles Kervrann
Bioinform.4
2014 Robustness of stochastic bandit policies
Antoine Salomon, Jean-Yves Audibert
Theor. Comput. Sci.1
2013 Lower bounds and selectivity of weak-consistent policies in stochastic multi-armed bandit problem
Antoine Salomon, Jean-Yves Audibert, Issam El Alaoui
J. Mach. Learn. Res.1
2011 Deviations of Stochastic Bandit Regret
Antoine Salomon, Jean-Yves Audibert
ALT1