Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Navid Zolghadr

dblp:39/1764 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Learning theory · 62% Reinforcement learning · 38%
Human-computer interaction and pervasive computing
1 paper
Interaction techniques and input · 77% User interface design and tools · 23%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
online learning
0.322013
Online Learning with Costly Features and Labels · NIPS 2013
An adaptive algorithm for finite stochastic partial monitoring · ICML 2012
Machine learning › Learning theory › online learning
regret bounds
0.212013
Online Learning with Costly Features and Labels · NIPS 2013
Machine learning › Reinforcement learning › bandit
partial monitoring
0.112012
An adaptive algorithm for finite stochastic partial monitoring · ICML 2012
Machine learning › Reinforcement learning
regret minimization
0.112012
An adaptive algorithm for finite stochastic partial monitoring · ICML 2012

Methods — techniques the papers use, named apart from their topics

simulation · 0.4predictive modeling · 0.4interpolation · 0.4extrapolation · 0.4online probing · 0.2adaptive algorithm · 0.1
YearPublicationVenuePosition
2020 Modeling and Reducing Spatial Jitter caused by Asynchronous Input and Output Rates
abstract
Jitter in interactive systems occurs when visual feedback is perceived as unstable or trembling even though the input signal is smooth or stationary. It can have multiple causes such as sensing noise, or feedback calculations introducing or exacerbating sensing imprecisions. Jitter can however occur even when each individual component of the pipeline works perfectly, as a result of the differences between the input frequency and the display refresh rate. This asynchronicity can introduce rapidly-shifting latencies between the rendered feedbacks and their display on screen, which can result in trembling cursors or viewports. % This paper contributes a better understanding of this particular type of jitter. We first detail the problem from a mathematical standpoint, from which we develop a predictive model of jitter amplitude as a function of input and output frequencies, and a new metric to measure this spatial jitter. Using touch input data gathered in a study, we developed a simulator to validate this model and to assess the effects of different techniques and settings with any output frequency. The most promising approach, when the time of the next display refresh is known, is to estimate (interpolate or extrapolate) the user's position at a fixed time interval before that refresh. % When input events occur at 125~Hz, as is common in touch screens, we show that an interval of 4 to 6~ms works well for a wide range of display refresh rates. This method effectively cancels most of the jitter introduced by input/output asynchronicity, while introducing minimal imprecision or latency.
Axel Antoine, Mathieu Nancel, Ella Ge, Jingjie Zheng, Navid Zolghadr, Géry Casiez
UIST5
2013 Online Learning with Costly Features and Labels
abstract
This paper introduces the online probing" problem: In each round, the learner is able to purchase the values of a subset of feature values. After the learner uses this information to come up with a prediction for the given round, he then has the option of paying for seeing the loss that he is evaluated against. Either way, the learner pays for the imperfections of his predictions and whatever he chooses to observe, including the cost of observing the loss function for the given round and the cost of the observed features. We consider two variations of this problem, depending on whether the learner can observe the label for free or not. We provide algorithms and upper and lower bounds on the regret for both variants. We show that a positive cost for observing the label significantly increases the regret of the problem."
Navid Zolghadr, Gábor Bartók, Russell Greiner, András György 0001, Csaba Szepesvári
NIPS1
2012 An adaptive algorithm for finite stochastic partial monitoring
Gábor Bartók, Navid Zolghadr, Csaba Szepesvári
ICML2