Johan Jonasson

16 papers A* 1A 2Journal 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
Posterior Sampling of Probabilistic Word Embeddings.
CoRR
Väinö Yrjänäinen, Isac Boström, Måns Magnusson, Johan Jonasson
2025 J jnl
Variational Quantum Optimization with Continuous Bandits.
CoRR
Marc Wanner, Johan Jonasson, Emil Carlsson, Devdatt P. Dubhashi
2023 J jnl
Elastic Gradient Descent, an Iterative Optimization Method Approximating the Solution Paths of the Elastic Net.
J. Mach. Learn. Res.
Oskar Allerbo, Johan Jonasson, Rebecka Jörnsten
2023 J jnl
Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification.
CoRR
Johan Jonasson, Jeffrey E. Steif, Olof Zetterqvist
2021 J jnl
Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions.
CoRR
Johan Jonasson, Måns Magnusson
2021 J jnl
Robust Neural Network Classification via Double Regularization.
CoRR
Olof Zetterqvist, Rebecka Jörnsten, Johan Jonasson
2020 A conf
Leave-One-Out Cross-Validation for Bayesian Model Comparison in Large Data.
AISTATS
Måns Magnusson, Aki Vehtari, Johan Jonasson, Michael Riis Andersen
2020 A conf
Optimal sampling in unbiased active learning.
AISTATS
Henrik Imberg, Johan Jonasson, Marina Axelson-Fisk
2019 A* conf
Bayesian leave-one-out cross-validation for large data.
ICML
Måns Magnusson, Michael Riis Andersen, Johan Jonasson, Aki Vehtari
2019 J jnl
Bayesian leave-one-out cross-validation for large data.
CoRR
Måns Magnusson, Michael Riis Andersen, Johan Jonasson, Aki Vehtari
2017 J jnl
Slow mixing for Latent Dirichlet allocation.
CoRR
Johan Jonasson
2007 J jnl
Positive Influence and Negative Dependence.
Comb. Probab. Comput.
Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan
2000 J jnl
An upper bound on the cover time for powers of graphs.
Discret. Math.
Johan Jonasson
2000 J jnl
Lollipop graphs are extremal for commute times.
Random Struct. Algorithms
Johan Jonasson
2000 J jnl
Percolation in a dependent random environment.
Random Struct. Algorithms
Johan Jonasson, Elchanan Mossel, Yuval Peres
1998 J jnl
On the Cover Time for Random Walks on Random Graphs.
Comb. Probab. Comput.
Johan Jonasson