Jonathan Keeler

dblp:313/2865 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2023
—ORCID · none

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

Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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.

Theoretical computer science
1 paper
Coding theory · 70% Information theory · 23% Mathematical optimization · 7%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization
adaptive quantization
0.712023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise · IEEE Trans. Inf. Theory 2023
Coding theory › source coding
fixed-length source coding
0.712023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise · IEEE Trans. Inf. Theory 2023
Information theory
networked control
0.712023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise · IEEE Trans. Inf. Theory 2023
Coding theory › source coding
quantization
0.712023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise · IEEE Trans. Inf. Theory 2023
Mathematical optimization › control theory
stabilization
0.212023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise · IEEE Trans. Inf. Theory 2023

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

lyapunov stochastic drift criteria · 0.7harris recurrence · 0.7
YearPublicationVenuePosition
2023 An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise
abstract
It is known that under fixed-rate information constraints, adaptive quantizers can be used to stabilize an open-loop-unstable linear system on$\mathbb {R}^{n}$driven by unbounded noise. These adaptive schemes can be designed so that they have near-optimal rate, and the resulting system will be stable in the sense of having an invariant probability measure, or ergodicity, as well as boundedness of the state second moment. Although structural results and information theoretic bounds of encoders have been studied, the performance of such adaptive fixed-rate quantizers beyond stabilization has not been addressed. In this paper, we propose a two-part adaptive (fixed-rate) coding scheme that achieves state second moment convergence to the classical optimum (i.e., for the fully observed setting) under mild moment conditions on the noise process. The first part, as in prior work, leads to ergodicity (via positive Harris recurrence) and the second part ensures that the state second moment converges to the classical optimum at high rates. These results are established using an intricate analysis which uses random-time state-dependent Lyapunov stochastic drift criteria as a core tool.
Jonathan Keeler, Tamás Linder, Serdar Yüksel
IEEE Trans. Inf. Theory1
2022 An Asymptotically Optimal Two-Part Coding Scheme for Networked Control under Fixed-Rate Constraints
abstract
It is known that fixed rate adaptive quantizers can be used to stabilize an open-loop-unstable linear system driven by unbounded noise. These quantizers can be designed so that they have near-optimal rate, and the resulting system will be stable in the sense of having an invariant probability measure, or ergodicity, as well as the boundedness of the state second moment. However, results on the minimization of the state second moment for such quantizers, an important goal in practice, do not seem to be available. In this paper, we construct a two-part adaptive coding scheme that is asymptotically optimal in terms of the second moments as the data rate grows large. The first part, as in prior work, leads to ergodicity (via positive Harris recurrence) and the second part attains order optimality of the invariant second moment, resulting in near optimal performance at high rates.
Jonathan Keeler, Tamás Linder, Serdar Yüksel
ISIT1