Jure Brence
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jure Brence has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sašo Džeroski
Jozef Stefan Institute
9 shared publications - Ljupčo Todorovski
University of Ljubljana
7 shared publications - Nina Omejc
Department of Knowledge Technologies, Jožef Stefan Institute, Ljubljana, Slovenia
3 shared publications - Boštjan Gec
Department of Knowledge Technologies, Jožef Stefan Institute, Ljubljana, Slovenia
2 shared publications - Edward Malina
European Space Agency, ESRIN, Frascati, Italy
2 shared publications - Jennifer Adams
CMCC Foundation, Euro-Mediterranean Centre on Climate Change, Viterbo, 01100, Italy
2 shared publications
Latest Publications
- 5 October 2025
- Published by Springer Nature
- p. 113-127
Bayesian Grammar Refinement for Efficient Equation Discovery
- 5 October 2025
- Published by Springer Nature
- p. 113-127
Bayesian Grammar Refinement for Efficient Equation Discovery
- Open Access
- 29 May 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (10) , 7689-7721
Probabilistic grammars for modeling dynamical systems from coarse, noisy, and partial data
Ordinary differential equations (ODEs) are a widely used formalism for the mathematical modeling of dynamical systems, a task omnipresent in scientific domains. The paper introduces a novel method for inferring ODEs from data, which extends ProGED, a method for equation discovery that allows users to formalize domain-specific knowledge as probabilistic context-free grammars and use it for constraining the space of candidate equations. The extended method can discover ODEs from partial observations of dynamical systems, where only a subset of state variables can be observed. To evaluate the performance of the newly proposed method, we perform a systematic empirical comparison with alternative state-of-the-art methods for equation discovery and system identification from complete and partial observations. The comparison uses Dynobench, a set of ten dynamical systems that extends the standard Strogatz benchmark. We compare the ability of the considered methods to reconstruct the known ODEs from synthetic data simulated at different temporal resolutions. We also consider data with different levels of noise, i.e., signal-to-noise ratios. The improved ProGED compares favourably to state-of-the-art methods for inferring ODEs from data regarding reconstruction abilities and robustness to data coarseness, noise, and completeness.
- 29 May 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (10) , 7689-7721
Open AccessProbabilistic grammars for modeling dynamical systems from coarse, noisy, and partial data
Ordinary differential equations (ODEs) are a widely used formalism for the mathematical modeling of dynamical systems, a task omnipresent in scientific domains. The paper introduces a novel method for inferring ODEs from data, which extends ProGED, a method for equation discovery that allows users to formalize domain-specific knowledge as probabilistic context-free grammars and use it for constraining the space of candidate equations. The extended method can discover ODEs from partial observations of dynamical systems, where only a subset of state variables can be observed. To evaluate the performance of the newly proposed method, we perform a systematic empirical comparison with alternative state-of-the-art methods for equation discovery and system identification from complete and partial observations. The comparison uses Dynobench, a set of ten dynamical systems that extends the standard Strogatz benchmark. We compare the ability of the considered methods to reconstruct the known ODEs from synthetic data simulated at different temporal resolutions. We also consider data with different levels of noise, i.e., signal-to-noise ratios. The improved ProGED compares favourably to state-of-the-art methods for inferring ODEs from data regarding reconstruction abilities and robustness to data coarseness, noise, and completeness.
- Open Access
- 13 March 2023
- Published by Springer Nature in Research Square
Probabilistic grammars for modeling dynamical systems from coarse, noisy, and partial data
Ordinary differential equations (ODEs) are a widely used formalism for the mathematical modeling of dynamical systems, a task omnipresent in scientific domains. The paper introduces a novel method for inferring ODEs from data. It extends ProGED, a method for equation discovery that employs probabilistic context-free grammars for constraining the space of candidate equations. The extended method can discover ODEs from partial observations of dynamical systems, where only a subset of state variables can be observed. To evaluate the performance of the newly proposed method, we perform a systematic empirical comparison with alternative state-of-the-art methods for equation discovery and system identification from complete and partial observations. The comparison involves a set of ten dynamical systems, an extension of the standard Strogatz benchmark. We compare the ability of methods to reconstruct the known ODEs from synthetic data simulated at different temporal resolutions and involving different signal-to-noise levels. The improved ProGED compares favorably to state-of-the-art methods for inferring ODEs from data regarding reconstruction abilities and robustness to data coarseness, noise, and completeness.
- 13 March 2023
- Published by Springer Nature in Research Square
Open AccessProbabilistic grammars for modeling dynamical systems from coarse, noisy, and partial data
Ordinary differential equations (ODEs) are a widely used formalism for the mathematical modeling of dynamical systems, a task omnipresent in scientific domains. The paper introduces a novel method for inferring ODEs from data. It extends ProGED, a method for equation discovery that employs probabilistic context-free grammars for constraining the space of candidate equations. The extended method can discover ODEs from partial observations of dynamical systems, where only a subset of state variables can be observed. To evaluate the performance of the newly proposed method, we perform a systematic empirical comparison with alternative state-of-the-art methods for equation discovery and system identification from complete and partial observations. The comparison involves a set of ten dynamical systems, an extension of the standard Strogatz benchmark. We compare the ability of methods to reconstruct the known ODEs from synthetic data simulated at different temporal resolutions and involving different signal-to-noise levels. The improved ProGED compares favorably to state-of-the-art methods for inferring ODEs from data regarding reconstruction abilities and robustness to data coarseness, noise, and completeness.
- Open Access
- 11 March 2023
- Published by Elsevier in Information Sciences
- Vol. 632, 742-756
Dimensionally-consistent equation discovery through probabilistic attribute grammars
- 11 March 2023
- Published by Elsevier in Information Sciences
- Vol. 632, 742-756
Open AccessDimensionally-consistent equation discovery through probabilistic attribute grammars
- Open Access
- 22 January 2023
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 5 (1) , 1-11
Boosting the performance of quantum annealers using machine learning
Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of problems that can be solved by quantum annealers is limited mainly by errors caused by environmental noise and intrinsic imperfections of the processor. We address the issue of intrinsic imperfections with a novel error correction approach, based on machine learning methods. Our approach adjusts the input Hamiltonian to maximize the probability of finding the solution. In our experiments, the proposed error correction method improved the performance of annealing by up to three orders of magnitude and enabled the solving of a previously intractable, maximally complex problem.
- 22 January 2023
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 5 (1) , 1-11
Open AccessBoosting the performance of quantum annealers using machine learning
Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of problems that can be solved by quantum annealers is limited mainly by errors caused by environmental noise and intrinsic imperfections of the processor. We address the issue of intrinsic imperfections with a novel error correction approach, based on machine learning methods. Our approach adjusts the input Hamiltonian to maximize the probability of finding the solution. In our experiments, the proposed error correction method improved the performance of annealing by up to three orders of magnitude and enabled the solving of a previously intractable, maximally complex problem.
- 6 November 2022
- Published by Springer Nature
- p. 22-31
Discovery of Differential Equations Using Probabilistic Grammars
- 6 November 2022
- Published by Springer Nature
- p. 22-31
Discovery of Differential Equations Using Probabilistic Grammars
- Open Access
- 22 March 2022
- Published by Springer Nature in Machine Learning
- Vol. 112 (4) , 1337-1363
Surrogate models of radiative transfer codes for atmospheric trace gas retrievals from satellite observations
Inversion of radiative transfer models (RTMs) is key to interpreting satellite observations of air quality and greenhouse gases, but is computationally expensive. Surrogate models that emulate the full forward physical RTM can speed up the simulation, reducing computational and timing costs and allowing the use of more advanced physics for trace gas retrievals. In this study, we present the development of surrogate models for two RTMs: the RemoTeC algorithm using the LINTRAN RTM and the SCIATRAN RTM. We estimate the intrinsic dimensionality of the input and output spaces and embed them in lower dimensional subspaces to facilitate the learning task. Two methods are tested for dimensionality reduction, autoencoders and principle component analysis (PCA), with PCA consistently outperforming autoencoders. Different sampling methods are employed for generating the training datasets: sampling focused on expected atmospheric parameters and latin hypercube sampling. The results show that models trained on the smaller (n = 1000) uniformly sampled dataset can perform as well as those trained on the larger (n = 50000), more focused dataset. Surrogate models for both datasets are able to accurately emulate Sentinel 5P spectra within a millisecond or less, as compared to the minutes or hours needed to simulate the full physical model. The SCIATRAN-trained forward surrogate models are able to generalize the emulation to a broader set of parameters and can be used for less constrained applications, while achieving a normalized RMSE of 7.3%. On the other hand, models trained on the LINTRAN dataset can completely replace the RTM simulation in more focused expected ranges of atmospheric parameters, as they achieve a normalized RMSE of 0.3%.
- 22 March 2022
- Published by Springer Nature in Machine Learning
- Vol. 112 (4) , 1337-1363
Open AccessSurrogate models of radiative transfer codes for atmospheric trace gas retrievals from satellite observations
Inversion of radiative transfer models (RTMs) is key to interpreting satellite observations of air quality and greenhouse gases, but is computationally expensive. Surrogate models that emulate the full forward physical RTM can speed up the simulation, reducing computational and timing costs and allowing the use of more advanced physics for trace gas retrievals. In this study, we present the development of surrogate models for two RTMs: the RemoTeC algorithm using the LINTRAN RTM and the SCIATRAN RTM. We estimate the intrinsic dimensionality of the input and output spaces and embed them in lower dimensional subspaces to facilitate the learning task. Two methods are tested for dimensionality reduction, autoencoders and principle component analysis (PCA), with PCA consistently outperforming autoencoders. Different sampling methods are employed for generating the training datasets: sampling focused on expected atmospheric parameters and latin hypercube sampling. The results show that models trained on the smaller (n = 1000) uniformly sampled dataset can perform as well as those trained on the larger (n = 50000), more focused dataset. Surrogate models for both datasets are able to accurately emulate Sentinel 5P spectra within a millisecond or less, as compared to the minutes or hours needed to simulate the full physical model. The SCIATRAN-trained forward surrogate models are able to generalize the emulation to a broader set of parameters and can be used for less constrained applications, while achieving a normalized RMSE of 7.3%. On the other hand, models trained on the LINTRAN dataset can completely replace the RTM simulation in more focused expected ranges of atmospheric parameters, as they achieve a normalized RMSE of 0.3%.
- Open Access
- 1 July 2021
- Published by Elsevier in Knowledge-Based Systems
- Vol. 224
Probabilistic grammars for equation discovery
- 1 July 2021
- Published by Elsevier in Knowledge-Based Systems
- Vol. 224
Open AccessProbabilistic grammars for equation discovery
- Open Access
Probabilistic Grammars for Equation Discovery
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, such as context-free grammars, have been used to limit the search spaces in equation discovery by providing hard constraints that specify which equations to consider and which not. In this paper, we propose the use of probabilistic context-free grammars in equation discovery. Such grammars encode soft constraints, specifying a prior probability distribution on the space of possible equations. We show that probabilistic grammars can be used to elegantly and flexibly formulate the parsimony principle, that favors simpler equations, through probabilities attached to the rules in the grammars. We demonstrate that the use of probabilistic, rather than deterministic grammars, in the context of a Monte-Carlo algorithm for grammar-based equation discovery, leads to more efficient equation discovery. Finally, by specifying prior probability distributions over equation spaces, the foundations are laid for Bayesian approaches to equation discovery.
Open AccessProbabilistic Grammars for Equation Discovery
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, such as context-free grammars, have been used to limit the search spaces in equation discovery by providing hard constraints that specify which equations to consider and which not. In this paper, we propose the use of probabilistic context-free grammars in equation discovery. Such grammars encode soft constraints, specifying a prior probability distribution on the space of possible equations. We show that probabilistic grammars can be used to elegantly and flexibly formulate the parsimony principle, that favors simpler equations, through probabilities attached to the rules in the grammars. We demonstrate that the use of probabilistic, rather than deterministic grammars, in the context of a Monte-Carlo algorithm for grammar-based equation discovery, leads to more efficient equation discovery. Finally, by specifying prior probability distributions over equation spaces, the foundations are laid for Bayesian approaches to equation discovery.
- 15 October 2020
- Published by Springer Nature
- p. 217-230
Learning Surrogates of a Radiative Transfer Model for the Sentinel 5P Satellite
- 15 October 2020
- Published by Springer Nature
- p. 217-230
Learning Surrogates of a Radiative Transfer Model for the Sentinel 5P Satellite