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

Bruno Charron

dblp:186/9722 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
evaluation
0.912025
MEMERAG: A Multilingual End-to-End Meta-Evaluation Benchmark for Retrieval Augmented Generation · ACL (1) 2025
Information retrieval › ranking
learning to rank
0.512021
PiRank: Scalable Learning To Rank via Differentiable Sorting · NeurIPS 2021
Information retrieval › ranking › learning to rank
listwise ranking
0.512021
PiRank: Scalable Learning To Rank via Differentiable Sorting · NeurIPS 2021
Information retrieval
ranking
0.512021
PiRank: Scalable Learning To Rank via Differentiable Sorting · NeurIPS 2021
Information retrieval
retrieval models
0.512021
PiRank: Scalable Learning To Rank via Differentiable Sorting · NeurIPS 2021
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.312025
MEMERAG: A Multilingual End-to-End Meta-Evaluation Benchmark for Retrieval Augmented Generation · ACL (1) 2025

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

retrieval-augmented generation · 1.7temperature relaxation · 0.5neuralsort · 0.5divide-and-conquer · 0.5differentiable sorting · 0.5
YearPublicationVenuePosition
2025 MEMERAG: A Multilingual End-to-End Meta-Evaluation Benchmark for Retrieval Augmented Generation
abstract
María Andrea Cruz Blandón, Jayasimha Talur, Bruno Charron, Dong Liu, Saab Mansour, Marcello Federico. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
María Andrea Cruz Blandón, Jayasimha Talur, Bruno Charron, Saab Mansour, Marcello Federico
ACL (1)3
2021 PiRank: Scalable Learning To Rank via Differentiable Sorting
abstract
A key challenge with machine learning approaches for ranking is the gap between the performance metrics of interest and the surrogate loss functions that can be optimized with gradient-based methods. This gap arises because ranking metrics typically involve a sorting operation which is not differentiable w.r.t. the model parameters. Prior works have proposed surrogates that are loosely related to ranking metrics or simple smoothed versions thereof, and often fail to scale to real-world applications. We propose PiRank, a new class of differentiable surrogates for ranking, which employ a continuous, temperature-controlled relaxation to the sorting operator based on NeuralSort [1]. We show that PiRank exactly recovers the desired metrics in the limit of zero temperature and further propose a divide-and-conquer extension that scales favorably to large list sizes, both in theory and practice. Empirically, we demonstrate the role of larger list sizes during training and show that PiRank significantly improves over comparable approaches on publicly available Internet-scale learning-to-rank benchmarks.
Robin M. E. Swezey, Aditya Grover, Bruno Charron, Stefano Ermon
NeurIPS3
2018 Large-scale recommendation for portfolio optimization
abstract
Individual investors are now massively using online brokers to trade stocks with convenient interfaces and low fees, albeit losing the advice and personalization traditionally provided by full-service brokers. We frame the problem faced by online brokers of replicating this level of service in a low-cost and automated manner for a very large number of users. Because of the care required in recommending financial products, we focus on a risk-management approach tailored to each user's portfolio and risk profile. We show that our hybrid approach, based on Modern Portfolio Theory and Collaborative Filtering, provides a sound and effective solution. The method is applicable to stocks as well as other financial assets, and can be easily combined with various financial forecasting models. We validate our proposal by comparing it with several baselines in a domain expert-based study.
Robin M. E. Swezey, Bruno Charron
RecSys2
2016 Extracting Semantic Information for e-Commerce
Bruno Charron, Yu Hirate, David Purcell, Martín Rezk
ISWC (2)1