Julien Bect

dblp:25/5086 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-0867-0215ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorTheory of computation · 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.

Theoretical computer science
2 papers
Mathematical optimization · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
bayesian optimization
0.912025
Relaxed Gaussian Process Interpolation: a Goal-Oriented Approach to Bayesian Optimization · J. Mach. Learn. Res. 2025
Mathematical optimization
continuous optimization
0.912025
Relaxed Gaussian Process Interpolation: a Goal-Oriented Approach to Bayesian Optimization · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.312025
Relaxed Gaussian Process Interpolation: a Goal-Oriented Approach to Bayesian Optimization · J. Mach. Learn. Res. 2025
Image and video processing
image restoration
0.012004
A l1-Unified Variational Framework for Image Restoration · ECCV (4) 2004
Image and video processing › image restoration
variational image restoration
0.012004
A l1-Unified Variational Framework for Image Restoration · ECCV (4) 2004
Mathematical optimization
variational methods
0.012004
A l1-Unified Variational Framework for Image Restoration · ECCV (4) 2004

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

reproducing kernel hilbert space · 1.7gaussian process · 1.7expected improvement · 1.7variational method · 0.1l1 regularization · 0.1
YearPublicationVenuePosition
2025 Relaxed Gaussian Process Interpolation: a Goal-Oriented Approach to Bayesian Optimization
abstract
This work presents a new procedure for obtaining predictive distributions in the context of Gaussian process (GP) modeling, with a relaxation of the interpolation constraints outside ranges of interest: the mean of the predictive distribution no longer necessarily interpolates the observed values when they are outside ranges of interest, but is simply constrained to remain outside. This method called relaxed Gaussian process (reGP) interpolation provides better predictive distributions in ranges of interest, especially in cases where a stationarity assumption for the GP model is not appropriate. It can be viewed as a goal-oriented method and becomes particularly interesting in Bayesian optimization, for example, for the minimization of an objective function, where good predictive distributions for low function values are important. When the expected improvement criterion and reGP are used for sequentially choosing evaluation points, the convergence of the resulting optimization algorithm is theoretically guaranteed (provided that the function to be optimized lies in the reproducing kernel Hilbert space attached to the known covariance of the underlying Gaussian process). Experiments indicate that using reGP instead of stationary GP models in Bayesian optimization is beneficial.
Sébastien Petit, Julien Bect, Emmanuel Vázquez
J. Mach. Learn. Res.2
2017 A Bayesian approach to constrained single- and multi-objective optimization
Paul Feliot, Julien Bect, Emmanuel Vázquez
J. Glob. Optim.2
2012 Summarizing posterior distributions in signal decomposition problems when the number of components is unknown
abstract
This paper addresses the problem of summarizing the posterior distributions that typically arise, in a Bayesian framework, when dealing with signal decomposition problems with unknown number of components. Such posterior distributions are defined over union of subspaces of differing dimensionality and can be sampled from using modern Monte Carlo techniques, for instance the increasingly popular RJ-MCMC method. No generic approach is available, however, to summarize the resulting variable-dimensional samples and extract from them component-specific parameters. We propose a novel approach to this problem, which consists in approximating the complex posterior of interest by a "simple"-but still variable-dimensional-parametric distribution. The distance between the two distributions is measured using the Kullback-Leibler divergence, and a Stochastic EM-type algorithm, driven by the RJ-MCMC sampler, is proposed to estimate the parameters. The proposed algorithm is illustrated on the fundamental signal processing example of joint detection and estimation of sinusoids in white Gaussian noise.
Alireza Roodaki, Julien Bect, Gilles Fleury
ICASSP2
2004 A l1-Unified Variational Framework for Image Restoration
Julien Bect, Laure Blanc-Féraud, Gilles Aubert, Antonin Chambolle
ECCV (4)1