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

Bela A. Frigyik

dblp:73/2191 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2014
0000-0002-4220-4680ORCID · reported

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

Artificial intelligence and machine learning · 4 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-authorTheory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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.

Artificial intelligence
6 papers
Learning theory · 34% Probabilistic and Bayesian machine learning · 32% Learning paradigms · 24%
Theoretical computer science
2 papers
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
multi-task learning
0.322014
Revisiting Stein's paradox: multi-task averaging · J. Mach. Learn. Res. 2014
Multi-Task Averaging · NIPS 2012
Machine learning › Learning theory › statistical estimation › regularized estimation
shrinkage estimation
0.212014
Revisiting Stein's paradox: multi-task averaging · J. Mach. Learn. Res. 2014
Machine learning › Learning theory › statistical pattern recognition
bayes error bound
0.112012
Bounds on the Bayes Error Given Moments · IEEE Trans. Inf. Theory 2012
Machine learning › Learning theory › statistical estimation
mean estimation
0.112012
Multi-Task Averaging · NIPS 2012
Machine learning › Trustworthy machine learning
uncertainty estimation
0.112012
Bounds on the Bayes Error Given Moments · IEEE Trans. Inf. Theory 2012
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › exponential family
dirichlet distribution
0.112010
Shadow Dirichlet for Restricted Probability Modeling · NIPS 2010
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › exponential family
maximum entropy models
0.112010
Shadow Dirichlet for Restricted Probability Modeling · NIPS 2010
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.112008
Functional Bregman Divergence and Bayesian Estimation of Distributions · IEEE Trans. Inf. Theory 2008
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.112008
Functional Bregman Divergence and Bayesian Estimation of Distributions · IEEE Trans. Inf. Theory 2008
Information theory › information measures › divergence measures
bregman divergence
0.112008
Functional Bregman Divergence and Bayesian Estimation of Distributions · IEEE Trans. Inf. Theory 2008
Information theory › information measures
divergence measures
0.112008
Functional Bregman Divergence and Bayesian Estimation of Distributions · IEEE Trans. Inf. Theory 2008
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification
0.112007
Bayesian Quadratic Discriminant Analysis · J. Mach. Learn. Res. 2007
Information theory
estimation theory
0.122012
Bounds on the Bayes Error Given Moments · IEEE Trans. Inf. Theory 2012
Functional Bregman Divergence and Bayesian Estimation of Distributions · IEEE Trans. Inf. Theory 2008
Information theory
moment constraints
0.012012
Bounds on the Bayes Error Given Moments · IEEE Trans. Inf. Theory 2012

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

james-stein estimator · 0.3truncated moment problem · 0.3curto-fialkow solutions · 0.3functional bregman divergence · 0.2bayesian estimation · 0.2cross-validation · 0.1expectation-maximization · 0.1conjugate priors · 0.1bayesian inference · 0.1
YearPublicationVenuePosition
2014 Revisiting Stein's paradox: multi-task averaging
Sergey Feldman, Maya R. Gupta, Bela A. Frigyik
J. Mach. Learn. Res.3
2012 Multi-Task Averaging
abstract
We present a multi-task learning approach to jointly estimate the means of multiple independent data sets. The proposed multi-task averaging (MTA) algorithm results in a convex combination of the single-task averages. We derive the optimal amount of regularization, and show that it can be effectively estimated. Simulations and real data experiments demonstrate that MTA both maximum likelihood and James-Stein estimators, and that our approach to estimating the amount of regularization rivals cross-validation in performance but is more computationally efficient.
Sergey Feldman, Maya R. Gupta, Bela A. Frigyik
NIPS3
2012 Bounds on the Bayes Error Given Moments
abstract
We show how to compute lower bounds for the supremum Bayes error if the class-conditional distributions must satisfy moment constraints, where the supremum is with respect to the unknown class-conditional distributions. Our approach makes use of Curto and Fialkow's solutions for the truncated moment problem. The lower bound shows that the popular Gaussian assumption is not robust in this regard. We also construct an upper bound for the supremum Bayes error by constraining the decision boundary to be linear.
Bela A. Frigyik, Maya R. Gupta
IEEE Trans. Inf. Theory1
2010 Shadow Dirichlet for Restricted Probability Modeling
abstract
Although the Dirichlet distribution is widely used, the independence structure of its components limits its accuracy as a model. The proposed shadow Dirichlet distribution manipulates the support in order to model probability mass functions (pmfs) with dependencies or constraints that often arise in real world problems, such as regularized pmfs, monotonic pmfs, and pmfs with bounded variation. We describe some properties of this new class of distributions, provide maximum entropy constructions, give an expectation-maximization method for estimating the mean parameter, and illustrate with real data.
Bela A. Frigyik, Maya R. Gupta, Yihua Chen 0003
NIPS1
2008 Functional Bregman divergence
abstract
To characterize the differences between two positive functions or two distributions, a class of distortion functions has recently been defined termed the functional Bregman divergences. The class generalizes the standard Bregman divergence defined for vectors, and includes total squared difference and relative entropy. Recently a key property was discovered for the vector Bregman divergence: that the mean minimizes the average Bregman divergence for a finite set of vectors. In this paper the analog result is proven: that the mean function minimizes the average Bregman divergence for a set of positive functions that can be parameterized by a finite number of parameters. In addition, the relationship of the functional Bregman divergence to the vector Bregman divergence and pointwise Bregman divergence is stated, as well as some important properties.
Bela A. Frigyik, Santosh Srivastava, Maya R. Gupta
ISIT1
2008 Functional Bregman Divergence and Bayesian Estimation of Distributions
abstract
A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functions or distributions, and generalizes the standard Bregman divergence for vectors and a previous pointwise Bregman divergence that was defined for functions. A recent result showed that the mean minimizes the expected Bregman divergence. The new functional definition enables the extension of this result to the continuous case to show that the mean minimizes the expected functional Bregman divergence over a set of functions or distributions. It is shown how this theorem applies to the Bayesian estimation of distributions. Estimation of the uniform distribution from independent and identically drawn samples is presented as a case study.
Bela A. Frigyik, Santosh Srivastava, Maya R. Gupta
IEEE Trans. Inf. Theory1
2007 Bayesian Quadratic Discriminant Analysis
Santosh Srivastava, Maya R. Gupta, Bela A. Frigyik
J. Mach. Learn. Res.3
2000 Phenomenological model of false lock in the sampling phase-locked loop
abstract
In addition to the stable fixed point which should be achieved under steady-state conditions, the sampling phase-locked loop (SPLL) implemented with a loop filter has another stable attractor in which an unwanted periodic solution, called false lock, develops in the loop. After the acquisition process, the SPLL either reaches the desired fixed point or gets into false lock, depending on the initial conditions. In every implemented circuit, the development of false lock has to be prevented. Although the false lock problem was reported earlier, an exact model to describe the behavior of SPLL in false lock has not yet been published. This paper propose a phenomenological model to explain why the false lock can develop and to describe the operation of SPLL in false lock.
Bela A. Frigyik, Géza Kolumbán
ISCAS1
2000 Frequency domain analysis of double sampling phase-locked loop
abstract
Double sampling phase-locked loop (2-SPLL) is used in frequency synthesis. The unique feature of single sampling PLL is that its phase detector (PD) has a very low unwanted periodic output in steady state. In 2-SPLL, a second sample and hold circuit (S&H) is connected in cascade to suppress further the unwanted periodic PD output. However, the absence of a proper baseband model and design equations prevent the exploitation of all benefits of 2-SPLL. This paper develops a nonlinear baseband model for the 2-SPLL. Then based on the linearized baseband model, analysis is performed in the frequency domain and the frequency responses required to determine the spectrum of the output signal as a function of reference and VCO noise and modulation inputs are developed. Finally, the theoretical results are verified by measurements.
Géza Kolumbán, Bela A. Frigyik, Michael Peter Kennedy
ISCAS2