Dino Sejdinovic

Dino Sejdinovic

Auto-generated profile, based on publicly available information

Dino Sejdinovic

School of Computer and Mathematical Sciences & Australian Institute for Machine Learning, University of Adelaide, Adelaide, Australia

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2019 in Science Advances
Verified
Journal Article
Open access
PDF file
JRJakob Runge
Jakob Runge
PNPeer Nowack
Peer Nowack
MKMarlene Kretschmer
Marlene Kretschmer
SFSeth Flaxman
Seth Flaxman
DSDino Sejdinovic
Dino Sejdinovic
A novel causal discovery method for estimating nonlinear interdependency networks from large time series datasets.

1 October 2013 in The Annals of Statistics
Verified
Journal Article
Open access
PDF file
DSDino Sejdinovic
Dino Sejdinovic
BSBharath Sriperumbudur
Bharath Sriperumbudur
AGArthur Gretton
Arthur Gretton
KFKenji Fukumizu
Kenji Fukumizu
We provide a unifying framework linking two classes of statistics used in two-sample and independence testing: on the one hand, the energy distances and distance covariances from the statistics literature; on the other, maximum mean discrepancies (MMD), that is, distances between embeddings of distributions to reproducing kernel Hilbert spaces (RKHS), as established in machine learning. In the case where the energy distance is computed with a semimetric of negative type, a positive definite kernel, termed distance kernel, may be defined such that the MMD corresponds exactly to the energy distance. Conversely, for any positive definite kernel, we can interpret the MMD as energy distance with respect to some negative-type semimetric. This equivalence readily extends to distance covariance using kernels on the product space. We determine the class of probability distributions for which the test statistics are consistent against all alternatives. Finally, we investigate the performance of the family of distance kernels in two-sample and independence tests: we show in particular that the energy distance most commonly employed in statistics is just one member of a parametric family of kernels, and that other choices from this family can yield more powerful tests.

24 January 2017 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
QZQinyi Zhang
Qinyi Zhang
SFSarah Filippi
Sarah Filippi
AGArthur Gretton
Arthur Gretton
DSDino Sejdinovic
Dino Sejdinovic
Representations of probability measures in reproducing kernel Hilbert spaces provide a flexible framework for fully nonparametric hypothesis tests of independence, which can capture any type of departure from independence, including nonlinear associations and multivariate interactions. However, these approaches come with an at least quadratic computational cost in the number of observations, which can be prohibitive in many applications. Arguably, it is exactly in such large-scale datasets that capturing any type of dependence is of interest, so striking a favourable trade-off between computational efficiency and test performance for kernel independence tests would have a direct impact on their applicability in practice. In this contribution, we provide an extensive study of the use of large-scale kernel approximations in the context of independence testing, contrasting block-based, Nyström and random Fourier feature approaches. Through a variety of synthetic data experiments, it is demonstrated that our large-scale methods give comparable performance with existing methods while using significantly less computation time and memory.

1 February 2019 in Statistical Science
Verified
Journal Article
Open access
PDF file
FBFrançois-Xavier Briol
François-Xavier Briol
COChris J. Oates
Chris J. Oates
MGMark Girolami
Mark Girolami
MOMichael Osborne
Michael Osborne
DSDino Sejdinovic
Dino Sejdinovic
A research frontier has emerged in scientific computation, wherein discretisation error is regarded as a source of epistemic uncertainty that can be modelled. This raises several statistical challenges, including the design of statistical methods that enable the coherent propagation of probabilities through a (possibly deterministic) computational work-flow, in order to assess the impact of discretisation error on the computer output. This paper examines the case for probabilistic numerical methods in routine statistical computation. Our focus is on numerical integration, where a probabilistic integrator is equipped with a full distribution over its output that reflects the fact that the integrand has been discretised. Our main technical contribution is to establish, for the first time, rates of posterior contraction for one such method. Several substantial applications are provided for illustration and critical evaluation, including examples from statistical modelling, computer graphics and a computer model for an oil reservoir.

9 October 2009 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
DSDino Sejdinovic
Dino Sejdinovic
Dejan VukobratovicDejan Vukobratovic
Dejan Vukobratovic
ADAngela Doufexi
Angela Doufexi
VSVojin Senk
Vojin Senk
RPRobert J. Piechocki
Robert J. Piechocki
A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a windowing technique rather than a weighted (non-uniform) selection of input symbols to achieve UEP property. The windowing approach introduces additional parameters in the UEP rateless code design, making it more general and flexible than the weighted approach. Furthermore, the windowing approach provides better performance of UEP scheme, which is confirmed both theoretically and experimentally.

19 August 2020 in Nature Communications
Verified
Journal Article
Open access
PDF file
HMH. Moon
H. Moon
DLD. T. Lennon
D. T. Lennon
JKJ. Kirkpatrick
J. Kirkpatrick
NEN. M. van Esbroeck
N. M. van Esbroeck
LCL. C. Camenzind
L. C. Camenzind
Natalia AresNatalia Ares
Natalia Ares
Variability is a problem for the scalability of semiconductor quantum devices. The parameter space is large, and the operating range is small. Our statistical tuning algorithm searches for specific electron transport features in gate-defined quantum dot devices with a gate voltage space of up to eight dimensions. Starting from the full range of each gate voltage, our machine learning algorithm can tune each device to optimal performance in a median time of under 70 minutes. This performance surpassed our best human benchmark (although both human and machine performance can be improved). The algorithm is approximately 180 times faster than an automated random search of the parameter space, and is suitable for different material systems and device architectures. Our results yield a quantitative measurement of device variability, from one device to another and after thermal cycling. Our machine learning algorithm can be extended to higher dimensions and other technologies.