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

Alexander Goldenshluger

dblp:43/6287 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2011
0000-0002-5496-5583ORCID · corroborated

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

Theory of computation · 4 · 4 first-author

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
4 papers
Information theory · 48% Mathematical optimization · 30% Algorithmic game theory and mechanism design · 23%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › estimation theory › minimax estimation
minimax lower bounds
0.112011
A Note on Performance Limitations in Bandit Problems With Side Information · IEEE Trans. Inf. Theory 2011
Algorithmic game theory and mechanism design
multi-armed bandit
0.112011
A Note on Performance Limitations in Bandit Problems With Side Information · IEEE Trans. Inf. Theory 2011
Mathematical optimization
sequential decision making
0.112011
A Note on Performance Limitations in Bandit Problems With Side Information · IEEE Trans. Inf. Theory 2011
Information theory › estimation theory
minimax estimation
0.132006
Recovering convex edges of an image from noisy tomographic data · IEEE Trans. Inf. Theory 2006
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation · IEEE Trans. Inf. Theory 1998
Adaptive de-noising of signals satisfying differential inequalities · IEEE Trans. Inf. Theory 1997
Image and video processing
image reconstruction
0.112006
Recovering convex edges of an image from noisy tomographic data · IEEE Trans. Inf. Theory 2006
Image and video processing › image reconstruction
tomographic reconstruction
0.112006
Recovering convex edges of an image from noisy tomographic data · IEEE Trans. Inf. Theory 2006
Mathematical optimization › control theory
system identification
0.011998
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation · IEEE Trans. Inf. Theory 1998
Information theory › estimation theory
adaptive estimation
0.011997
Adaptive de-noising of signals satisfying differential inequalities · IEEE Trans. Inf. Theory 1997
Mathematical optimization › statistical estimation › regression
nonparametric regression
0.011997
Adaptive de-noising of signals satisfying differential inequalities · IEEE Trans. Inf. Theory 1997
Information theory › estimation theory
signal estimation
0.011997
Adaptive de-noising of signals satisfying differential inequalities · IEEE Trans. Inf. Theory 1997

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

persistent excitation analysis · 0.1minimax lower bounds · 0.1support function estimation · 0.1radon transform · 0.1nonparametric minimax approach · 0.0least-squares estimation · 0.0spatial adaptive estimation · 0.0differential inequality · 0.0
YearPublicationVenuePosition
2011 A Note on Performance Limitations in Bandit Problems With Side Information
abstract
We consider a sequential adaptive allocation problem which is formulated as a traditional two armed bandit problem but with one important modification: at each time step t, before selecting which arm to pull, the decision maker has access to a random variable Xtwhich provides information on the reward in each arm. Performance is measured as the fraction of time an inferior arm (generating lower mean reward) is pulled. We derive a minimax lower bound that proves that in the absence of sufficient statistical "diversity" in the distribution of the covariate X, a property that we shall refer to as lack of persistent excitation, no policy can improve on the best achievable performance in the traditional bandit problem without side information.
Alexander Goldenshluger, Assaf Zeevi
IEEE Trans. Inf. Theory1
2006 Recovering convex edges of an image from noisy tomographic data
abstract
We consider the problem of recovering edges of an image from noisy tomographic data. The original image is assumed to have a discontinuity jump (edge) along the boundary of a compact convex set. The Radon transform of the image is observed with noise, and the problem is to estimate the edge. We develop an estimation procedure which is based on recovering the support function of the edge. It is shown that the proposed estimator is nearly optimal in order in a minimax sense. Numerical examples illustrate reasonable practical behavior of the estimation procedure.
Alexander Goldenshluger, Vladimir G. Spokoiny
IEEE Trans. Inf. Theory1
1998 Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation
abstract
The paper deals with estimating the transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for measuring the estimation accuracy. The quality of an estimator is measured by its worst case error over a family of transfer functions. The families with polynomially and exponentially decaying impulse response sequences are considered. We establish nonasymptotic upper bounds on the accuracy of the least squares estimator for finite impulse response approximation. It is shown that the attainable estimation accuracy is determined essentially by the rate at which the "true" impulse response tends to zero. Lower bounds on the estimation accuracy are presented. An adaptive estimator which does not exploit any a priori information about the "true" system, is developed.
Alexander Goldenshluger
IEEE Trans. Inf. Theory1
1997 Adaptive de-noising of signals satisfying differential inequalities
abstract
The paper is devoted to spatial adaptive estimation of signals satisfying linear differential inequalities with an unknown differential operator of a given order. The classes of signals under consideration cover a wide variety of classes common to nonparametric regression. In particular, they contain the signals whose parameters of smoothness are not uniformly bounded, even locally. We develop an estimator which is optimal in order over a wide range of the classes and "discrete" global accuracy measures.
Alexander Goldenshluger, Arkadi Nemirovski
IEEE Trans. Inf. Theory1