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

Ines Wilms

dblp:179/7831 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-3269-4601ORCID · verified

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

Artificial intelligence and machine learning · 2 · 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.

Artificial intelligence
2 papers
Time series and sequential data · 30% Probabilistic and Bayesian machine learning · 20% Graph learning · 20%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.612022
Tree-based Node Aggregation in Sparse Graphical Models · J. Mach. Learn. Res. 2022
Machine learning › Graph learning
node aggregation
0.612022
Tree-based Node Aggregation in Sparse Graphical Models · J. Mach. Learn. Res. 2022
Mathematical optimization › continuous optimization
convex optimization
0.612022
Tree-based Node Aggregation in Sparse Graphical Models · J. Mach. Learn. Res. 2022
Machine learning › Optimization for machine learning › sparse learning
group lasso
0.412020
High Dimensional Forecasting via Interpretable Vector Autoregression · J. Mach. Learn. Res. 2020
Machine learning › Learning theory › statistical estimation
regularized estimation
0.412020
High Dimensional Forecasting via Interpretable Vector Autoregression · J. Mach. Learn. Res. 2020
Machine learning › Time series and sequential data
time series modeling
0.412020
High Dimensional Forecasting via Interpretable Vector Autoregression · J. Mach. Learn. Res. 2020
Machine learning › Time series and sequential data › time series modeling
vector autoregressive model
0.412020
High Dimensional Forecasting via Interpretable Vector Autoregression · J. Mach. Learn. Res. 2020

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

graphical lasso · 1.1alternating direction method of multipliers · 1.1group lasso · 0.4convex regularization · 0.4
YearPublicationVenuePosition
2022 Tree-based Node Aggregation in Sparse Graphical Models
abstract
High-dimensional graphical models are often estimated using regularization that is aimed at reducing the number of edges in a network. In this work, we show how even simpler networks can be produced by aggregating the nodes of the graphical model. We develop a new convex regularized method, called the tree-aggregated graphical lasso or tag-lasso, that estimates graphical models that are both edge-sparse and node-aggregated. The aggregation is performed in a data-driven fashion by leveraging side information in the form of a tree that encodes node similarity and facilitates the interpretation of the resulting aggregated nodes. We provide an efficient implementation of the tag-lasso by using the locally adaptive alternating direction method of multipliers and illustrate our proposal's practical advantages in simulation and in applications in finance and biology.
Ines Wilms, Jacob Bien
J. Mach. Learn. Res.1
2020 High Dimensional Forecasting via Interpretable Vector Autoregression
abstract
Vector autoregression (VAR) is a fundamental tool for modeling multivariate time series. However, as the number of component series is increased, the VAR model becomes overparameterized. Several authors have addressed this issue by incorporating regularized approaches, such as the lasso in VAR estimation. Traditional approaches address overparameterization by selecting a low lag order, based on the assumption of short range dependence, assuming that a universal lag order applies to all components. Such an approach constrains the relationship between the components and impedes forecast performance. The lasso-based approaches perform much better in high-dimensional situations but do not incorporate the notion of lag order selection. We propose a new class of hierarchical lag structures (HLag) that embed the notion of lag selection into a convex regularizer. The key modeling tool is a group lasso with nested groups which guarantees that the sparsity pattern of lag coefficients honors the VAR's ordered structure. The proposed HLag framework offers three basic structures, which allow for varying levels of flexibility, with many possible generalizations. A simulation study demonstrates improved performance in forecasting and lag order selection over previous approaches, and macroeconomic, financial, and energy applications further highlight forecasting improvements as well as HLag's convenient, interpretable output.
William B. Nicholson, Ines Wilms, Jacob Bien, David S. Matteson
J. Mach. Learn. Res.2