Johan Jonasson

According to our database, Johan Jonasson authored at least 12 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification.

Johan Jonasson, Jeffrey E. Steif, Olof Zetterqvist

CoRR, 2023

2021

Robust Neural Network Classification via Double Regularization.

Olof Zetterqvist, Rebecka Jörnsten, Johan Jonasson

CoRR, 2021

Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions.

Johan Jonasson, Måns Magnusson

CoRR, 2021

2020

Leave-One-Out Cross-Validation for Bayesian Model Comparison in Large Data.

Måns Magnusson, Aki Vehtari, Johan Jonasson, Michael Riis Andersen

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Optimal sampling in unbiased active learning.

Henrik Imberg, Johan Jonasson, Marina Axelson-Fisk

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Bayesian leave-one-out cross-validation for large data.

Måns Magnusson, Michael Riis Andersen, Johan Jonasson, Aki Vehtari

Proceedings of the 36th International Conference on Machine Learning, 2019

2017

Slow mixing for Latent Dirichlet allocation.

Johan Jonasson

CoRR, 2017

2007

Positive Influence and Negative Dependence.

Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan

Comb. Probab. Comput., 2007

2000

Percolation in a dependent random environment.

Johan Jonasson, Elchanan Mossel, Yuval Peres

Random Struct. Algorithms, 2000

Lollipop graphs are extremal for commute times.

Johan Jonasson

Random Struct. Algorithms, 2000

An upper bound on the cover time for powers of graphs.

Johan Jonasson

Discret. Math., 2000

1998

On the Cover Time for Random Walks on Random Graphs.

Johan Jonasson

Comb. Probab. Comput., 1998