MonMonday | TueTuesday | WedWednesday | ThuThursday | FriFriday | SatSaturday | SunSunday |
---|---|---|---|---|---|---|
March 1, 2021 | March 2, 2021 | March 3, 2021 | March 4, 2021 | March 5, 2021 | March 6, 2021 | March 7, 2021 |
Upcoming Seminars
- 2:00 pm – 4:00 pm, April 26, 2021 – PhD Seminars IX
Subjects of interest
applied mathematics asteroid exploration biological systems brain combinatorial optimization communication conductivity estimation dynamic dynamics EEG fixed point loops fluid dynamics functional emmbeddings fusion plasmas Galerkin time domain methods git health-biology infection spread invariant manifolds mapping marketing mesh modeling nanophotonics networks networks-systems-distributed-computing neuronal cells numerical simulations optimal transport optimisation optimization pattern recognition PDE protein function radar applications regularization retina routing applications scientific dissemination sed shape matching source localization stochastic gradient algorithm variability workshopArchives
- April 2021
- March 2021
- January 2021
- December 2020
- November 2020
- October 2020
- November 2019
- October 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- July 2018
- June 2018
- January 2018
- November 2017
- October 2017
- September 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
Calendar
March 2021 MMonday TTuesday WWednesday TThursday FFriday SSaturday SSunday 1March 1, 2021 2March 2, 2021 3March 3, 2021 4March 4, 2021 5March 5, 2021 6March 6, 2021 7March 7, 2021 8March 8, 2021 9March 9, 2021 10March 10, 2021 11March 11, 2021 12March 12, 2021 13March 13, 2021 14March 14, 2021 15March 15, 2021 10:00 am: PhD Seminars VI
10:00 am: PhD Seminars VIMarch 15, 2021 –
Talk 1
Speaker
Nicholas Halliwell (Wimmics)
Title
Avoiding Far-Fetched Counterfactuals to Explain Automated Decisions
Abstract
A popular way to explain a decision made by a black-box model is via a counterfactual explanation: for a given input, find the closest counterfactual input that leads to the desired outcome. Here we raise the issue that state-of-the-art counterfactual explanation techniques can easily propose very implausible counterfactuals. A generated counterfactual may have feature values that cannot exist together, e.g., a 20 year old employee with 30 years of work experience. Indeed, these techniques ignore the distribution of the inputs. To overcome this issue, we define a data-aware distance when searching for counterfactuals. This distance is defined using binary trees learned from the data to form counterfactual explanations with realistic feature values. Using both real and simulated datasets, we show that this approach produces counterfactual explanations closer on average to training data than current state-of-the-art methods.
Talk 2
Minh Hoang LE (Eurocom)
Title
An Additional Correction to Robistify DoA-based 2D Positioning Algorithm
Abstract
Direction of arrival (DoA) estimation is crucial to improve the performance of communications systems, which has been greatly improved thanks to multi-antenna techniques leading to much more accurate results in localization. Unlike the range-based ones, the direction-based positioning algorithms estimate the unknown position by the measured angle whose value must be predefined in an interval of 2π-length. Noisy measurements with values near the edge of this interval can lead to drastic estimation errors, making the convergence of iterative procedures much more challenging. In this paper, we propose an iterative Maximum Likelihood (ML) estimator for positioning estimation. Our procedure is based on the atan2 function, which has the 2π-long codomain to map the DoA. Moreover, a novel mechanism to make the estimation near the edges much more robust, an additional correction scheme is proposed to robustify the final estimates. Simulation results show significant performance improvement compared to the methods with no correction.
16March 16, 2021 17March 17, 2021 18March 18, 2021 19March 19, 2021 20March 20, 2021 21March 21, 2021 22March 22, 2021 23March 23, 2021 24March 24, 2021 25March 25, 2021 26March 26, 2021 27March 27, 2021 28March 28, 2021 29March 29, 2021 2:00 pm: PhD Seminars VII
2:00 pm: PhD Seminars VIIMarch 29, 2021 –
Ta
lk 1
Speaker
Simone Ebert (Biovision)
Title
The Role of Dynamical Synapses in Retinal Surprise Coding
Abstract
At the first stage of visual perception, the retina transforms a visual scene into an efficient neural code that is conveyed to the rest of the brain. The retina’s organization is constituted of parallel pathways that selectively carry information about specific features of the visual input rather than the raw image. In addition, the retina predominantly encodes changes in the visual scene by responding to deviations from an expectation based on the visual scene history. Indeed, in a rapidly changing visual environment, the retina must rapidly adapt its prediction to the current input to efficiently detect a deviation. In this context, we are exploring the role of dynamical synapses, adapting on a short timescale, in the retinas’ ability to accurately detect ‘surprise’.
To this end, we take advantage of an experimentally observable example of surprise detection in the retina, the Omitted Stimulus Response (OSR): when a regular sequence of flashes suddenly ends, the retina responds to this “surprise” by generating a pulse of activity signaling the missing stimulus, which is precisely timed to the period of the previously presented flash sequence. It is not clear yet which computations within and between the retinal pathways can provide such a high content of information in the output spiking rate. We believe that this example is a key to understand how retina respond to surprise in more complex visual scenes.
We conduct electrophysiological experiments in which we selectively inhibit retinal pathways and cell types to identify the circuit components necessary for this output behavior. Based on these findings, we construct the architecture of a computational model in which cells are connected via dynamical synapses. We then simulate the retinas response to a periodic stimulus to examine the role of short-term plasticity in shaping the response pattern to OSR.
Talk 2
Othmane Belmoukadam (DIANA)
Title
From Encrypted Video Traces to Viewport Classification
Abstract
The Internet has changed drastically in recent years, multiple novel applications and services have emerged, all about consuming digital content. In parallel, users are no longer satisfied by the Internet’s best effort service, instead, they expect a seamless service of high quality from the side of the network. This has increased the pressure on Internet service providers (ISP) in their effort to efficiently engineer their traffic and improve their end-users’ experience. Content providers from their side, and to further protect the content of their customers, have shifted towards end-to-end encryption (e.g., TLS/SSL), which has complicated even further the task of ISPs in handling the traffic in their network. The challenge is notable for video streaming traffic which is driving the Internet traffic growth, and which imposes tight constraints on the quality of service provided by the network depending on the content of the video stream and the equipment on the end-user premises. Video streaming relies on the dynamic adaptive streaming over HTTP (DASH) protocol which takes into consideration the underlying network conditions (e.g., delay, loss rate, and throughput) and the viewport capacity (e.g., screen resolution) to improve the experience of the end user in the limit of available resources. Nevertheless, knowing the reality of the encrypted video traffic is of great help to ISPs as it allows taking appropriate network management actions. In this work, we propose an experimental framework able to infer fine-grained video flow information such as chunk sizes from encrypted YouTube video traces. We also present a novel technique to separate video and audio chunks from encrypted traces based on Gaussian Mixture Models (GMM). We evaluate our technique with real chunk sizes (Audio/Video) collected through the browser using the Chrome Web Request API [1]. Then, we leverage these results and our dataset to train a model able to predict the class of viewport (either SD or HD) per video session with an average 92% accuracy and 85% F1 score.
30March 30, 2021 31March 31, 2021 1April 1, 2021 2April 2, 2021 3April 3, 2021 4April 4, 2021