JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for ALLSTAT Archives


ALLSTAT Archives

ALLSTAT Archives


allstat@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

ALLSTAT Home

ALLSTAT Home

ALLSTAT  March 2016

ALLSTAT March 2016

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Final Programme of the Royal Holloway Probability and Statistics Colloquium 31st March, RHUL, Egham

From:

Alexey Koloydenko <[log in to unmask]>

Reply-To:

Alexey Koloydenko <[log in to unmask]>

Date:

Tue, 1 Mar 2016 13:25:01 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (57 lines)

Royal Holloway Applied Probability and Statistics Colloquium
Date: 31st March 2016
Venue: Moore Annex 34, RHUL, Egham, TW20 0EX
Registration - free of charge (lunch and dinner paid for speakers only)
http://www.123contactform.com/form-1375856/Event-Registration-Form

Links to local B&B
https://venue-booking.royalholloway.ac.uk/BnB/
http://www.hydeawayhouse.co.uk/

Final Programme:
http://personal.rhul.ac.uk/utah/113/StatsColloqium2016.html

9:15am Welcoming tea and coffee
Morning Session: Applications

9:30-10:30am  Misleading Metrics: On Evaluating Machine Learning for Malware with Confidence, Lorenzo Cavallaro, Information Security Group, RHUL
Joint work with Roberto Jordaney, Zhi Wang, Davide Papini, Ilia Nouretdinov, and Lorenzo Cavallaro.
Abstract:  
Malware pose a serious and challenging threat across the Internet and the need for automated learning-based approaches has become rapidly clear. Machine learning has long been acknowledged as a promising technique to identify and classify malware threats; such a powerful technique is unfortunately often seen as a black-box panacea, where little is understood and the results—especially with high accuracy—are taken without questioning their quality. For such reasons, results are often biased by the choice of empirical thresholds or dataset-specific artefacts, hindering the ability to set easy-to-understand error metrics and thus compare different approaches. This setting, calls for new metrics that look beyond quantitative measurements (e.g., precision and recall), and help in scientifically assessing the soundness of the underlying machine learning tasks. To this end, we propose conformal evaluator, a framework designed at evaluating the quality of a result in terms of statistical metrics such as credibility and confidence. Credibility tells you how much a sample is credited with one given prediction (e.g., a label), whereas confidence focuses on pointing out how much a given sample is distinguished from other predictions. Such evaluation metrics give useful insights, providing a quantifiable per-choice level of assurance and reliability. Core of conformal evaluator is a non-conformity measure, which, in essence, allows for measuring the difference between a sample and a set of samples. For this reason, our framework is general enough to be immediately applied by a large class of algorithms that rely on distances to identify and classify malware, allowing to better understand and compare machine learning results. To further support our claim, we present case studies where the outcome of three different algorithms are evaluated under conformal evaluator settings. We show how traditional metrics mislead about the performance of different algorithms. Instead, conformal evaluator’s metrics enable us to understand the reasons behind the performance of a given algorithm, and reveal shortcomings of apparently highly accurate methods.

10:30-10:45am discussion

10:45-11:45am On modeling computed tomography (CT) and magnetic resonance imaging (MRI) data, Kristi Kuljus, Institute of Mathematical Statistics, University of Tartu, Estonia
Abstract: 
Possibilities for using Markov models in modeling CT and MRI data are studied. We are interested in estimating CT equivalent information from MRI sequences. Such substitute CT images are needed for example in dose planning for radiotherapy. One way to generate substitute CT images is to use regression: the joint distribution of CT and MRI sequences is modeled by a mixture of multivariate normal distributions, and the regression function for calculating substitute CT images given the MRI sequences is obtained by just weighting together conditional expectations of multivariate normal distributions. The obtained regression function depends on how spatial information is included in the modeling procedure. Gaussian mixture models assume independence between voxels, while Markov random field (MRF) models allow for spatial dependence through a Markov random field prior on the mixture components. Hidden Markov (chain) models (HMMs) are in this context somewhere in the middle: to be able to apply HMMs to 3-dimensional data we have to "sequence" the data and lose therefore some information on the neighbourhood structure. We discuss differences between HMM and MRF models and how this affects the modeling results using head data.

11:45am-12:00pm discussion

12:00-1:00pm  On Bayesian segmentation, Jüri Lember, Institute of Mathematical Statistics, University of Tartu, Estonia
Abstract:
We consider the segmentation or decoding problem with hidden Markov models in a fully Bayesian setup. The main focus is MAP or Viterbi segmentation where the goal is to find the path with maximum posterior probability. In the Bayesian setup the Viterbi path cannot be found by a dynamic programming (Viterbi) algorithm any more. We compare several iterative methods for finding the MAP path including simulated annealing, the frequentist's parameter estimation and the segmetation approach and many more.  

1-2pm lunch at the Senior Common Room (SCR), Fournder's Building

Afternoon Session: Random Processes
2-2:15pm coffee/tea
2:15-3:15pm Moments of passage times, explosion, and implosion for continuous time Markov chains, Mikhail Menshikov, Durham University, joint work with Dimitri Petritis (University of Rennes, France).
Abstract:  
We establish general theorems quantifying the notion of recurrence— through an estimation of the moments of passage times—for irreducible continuous-time Markov chains on countably infinite state spaces. Sharp conditions of occurrence of the phenomenon of explosion are also obtained.  A new phenomenon of implosion is introduced and sharp conditions for its occurrence are proven.
3:15-3:30pm discussion

3:30-4:30pm  Non-homogeneous random walks: Anomalous recurrence and angular asymptotics, Andrew Wade, Durham University
Abstract: 
Spatially homogeneous random walks (i.e., partial sums of i.i.d. random vectors) are well understood. The most delicate regime is when the walk has zero drift, where (under mild conditions) the walk is recurrent in dimensions 1 or 2 but transient in dimension 3 or more. If spatial homogeneity is relaxed, very different behaviour can be observed: zero-drift random walks that are recurrent in 3 dimensions, or transient in 2 dimensions, for example. To probe precisely the recurrence-transience phase transition it is natural to study the asymptotically-zero drift regime (in analogy to classical one-dimensional work of Lamperti). I will survey some results on recurrence behaviour and angular asymptotics for this class of  spatially non-homogeneous random walks, including joint work with Nicholas Georgiou, Iain MacPhee, Mikhail Menshikov, and Aleksandar Mijatovic.

4:30-5pm closing discussion over tea/coffee
6pm dinner in Egham (location TBA)

Contact organizers: Alexey Koloydenko email: alexey dot koloydenko at rhul dot ac dot uk

You may leave the list at any time by sending the command

SIGNOFF allstat

to [log in to unmask], leaving the subject line blank.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager