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

Joachim Utans

dblp:21/6777 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 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
3 papers
Deep learning architectures and training · 51% Representation and self-supervised learning · 31% Probabilistic and Bayesian machine learning · 9%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › architecture learning
architecture selection
0.011991
Principled Architecture Selection for Neural Networks: Application to Corporate Bond Rating Prediction · NIPS 1991
Machine learning › Probabilistic and Bayesian machine learning › hierarchical modeling
hierarchical model
0.011993
Learning in Compositional Hierarchies: Inducing the Structure of Objects from Data · NIPS 1993
Computer vision › Image recognition and object detection
object recognition
0.011992
Improving Convergence in Hierarchical Matching Networks for Object Recognition · NIPS 1992
YearPublicationVenuePosition
1995 Input variable selection for neural networks: application to predicting the U.S. business cycle
abstract
Selecting a "best subset" of input variables is a critical issue in forecasting. This is especially true when the number of available input series is large, and an exhaustive search through all combinations of variables is computationally infeasible. Inclusion of irrelevant variables not only doesn't help prediction, but can reduce forecasting accuracy through added noise or systematic bias. We demonstrate a technique called "sensitivity-based pruning" (SBP) that removes irrelevant input variables from a nonlinear forecasting or regression model. The technique makes use of a saliency measure computed for each input variable and uses estimates of prediction risk for determining the number of input variables to prune. We present preliminary results of the SBP technique applied to neural network predictors of a key business cycle measure, the US Index of Industrial Production.
Joachim Utans, John E. Moody, Steven Rehfuss, Hava T. Siegelmann
CIFEr1
1994 Statistical Physics, Mixtures of Distributions, and the EM Algorithm
abstract
We show that there are strong relationships between approaches to optmization and learning based on statistical physics or mixtures of experts. In particular, the EM algorithm can be interpreted as converging either to a local maximum of the mixtures model or to a saddle point solution to the statistical physics system. An advantage of the statistical physics approach is that it naturally gives rise to a heuristic continuation method, deterministic annealing, for finding good solutions.
Alan L. Yuille, Paul E. Stolorz, Joachim Utans
Neural Comput.3
1993 Learning in Compositional Hierarchies: Inducing the Structure of Objects from Data
Joachim Utans
NIPS1
1992 Improving Convergence in Hierarchical Matching Networks for Object Recognition
Joachim Utans, Gene Gindi
NIPS1
1991 Principled Architecture Selection for Neural Networks: Application to Corporate Bond Rating Prediction
John E. Moody, Joachim Utans
NIPS2