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

Morgane Ayle

dblp:266/5488 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
3 papers
Efficient and distributed learning · 54% Image recognition and object detection · 28% Graph learning · 18%
Databases, data mining, and information retrieval
1 paper
Graph data management · 100%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.612022
Winning the Lottery Ahead of Time: Efficient Early Network Pruning · ICML 2022
Machine learning › Efficient and distributed learning › model compression
pruning
0.612022
Winning the Lottery Ahead of Time: Efficient Early Network Pruning · ICML 2022
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning
0.612022
Winning the Lottery Ahead of Time: Efficient Early Network Pruning · ICML 2022
Computer vision › Image recognition and object detection › object detection
bounding box refinement
0.412020
BAR - A Reinforcement Learning Agent for Bounding-Box Automated Refinement · AAAI 2020
Computer vision › Image recognition and object detection
object detection
0.412020
BAR - A Reinforcement Learning Agent for Bounding-Box Automated Refinement · AAAI 2020
Graph data management
graph representation
0.212022
End-to-End Learning of Probabilistic Hierarchies on Graphs · ICLR 2022
Human-AI interaction › human-in-the-loop
human-in-the-loop annotation
0.112020
BAR - A Reinforcement Learning Agent for Bounding-Box Automated Refinement · AAAI 2020

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

end-to-end learning · 1.1deep reinforcement learning · 0.9contextual bandit · 0.9gradient flow preservation · 0.6early pruning · 0.6
YearPublicationVenuePosition
2022 End-to-End Learning of Probabilistic Hierarchies on Graphs
Daniel Zügner, Bertrand Charpentier, Morgane Ayle, Sascha Geringer, Stephan Günnemann
ICLR3
2022 Winning the Lottery Ahead of Time: Efficient Early Network Pruning
abstract
Pruning, the task of sparsifying deep neural networks, received increasing attention recently. Although state-of-the-art pruning methods extract highly sparse models, they neglect two main challenges: (1) the process of finding these sparse models is often very expensive; (2) unstructured pruning does not provide benefits in terms of GPU memory, training time, or carbon emissions. We propose Early Compression via Gradient Flow Preservation (EarlyCroP), which efficiently extracts state-of-the-art sparse models before or early in training addressing challenge (1), and can be applied in a structured manner addressing challenge (2). This enables us to train sparse networks on commodity GPUs whose dense versions would be too large, thereby saving costs and reducing hardware requirements. We empirically show that EarlyCroP outperforms a rich set of baselines for many tasks (incl. classification, regression) and domains (incl. computer vision, natural language processing, and reinforcment learning). EarlyCroP leads to accuracy comparable to dense training while outperforming pruning baselines.
John Rachwan, Daniel Zügner, Bertrand Charpentier, Simon Geisler, Morgane Ayle, Stephan Günnemann
ICML5
2020 BAR - A Reinforcement Learning Agent for Bounding-Box Automated Refinement
abstract
Research has shown that deep neural networks are able to help and assist human workers throughout the industrial sector via different computer vision applications. However, such data-driven learning approaches require a very large number of labeled training images in order to generalize well and achieve high accuracies that meet industry standards. Gathering and labeling large amounts of images is both expensive and time consuming, specifically for industrial use-cases. In this work, we introduce BAR (Bounding-box Automated Refinement), a reinforcement learning agent that learns to correct inaccurate bounding-boxes that are weakly generated by certain detection methods, or wrongly annotated by a human, using either an offline training method with Deep Reinforcement Learning (BAR-DRL), or an online one using Contextual Bandits (BAR-CB). Our agent limits the human intervention to correcting or verifying a subset of bounding-boxes instead of re-drawing new ones. Results on a car industry-related dataset and on the PASCAL VOC dataset show a consistent increase of up to 0.28 in the Intersection-over-Union of bounding-boxes with their desired ground-truths, while saving 30%-82% of human intervention time in either correcting or re-drawing inaccurate proposals.
Morgane Ayle, Jimmy Tekli, Julia El Zini, Boulos El Asmar, Mariette Awad
AAAI1