Demo Data from VLDB 2026 / reviewers in the wild / expert
Daniel Walter
dblp:169/4731
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Mathematical optimization · 100% | |
| Artificial intelligence
1 paper |
Transfer learning and domain adaptation · 44% Image recognition and object detection · 44% Vision and language · 13% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › sequential decision making
feedback policy |
0.7 | 1 | 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial Approximations · J. Mach. Learn. Res. 2023 |
Mathematical optimization › control theory › optimal control
hamilton-jacobi-bellman equation |
0.7 | 1 | 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial Approximations · J. Mach. Learn. Res. 2023 |
Mathematical optimization › control theory
optimal control |
0.7 | 1 | 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial Approximations · J. Mach. Learn. Res. 2023 |
Mathematical optimization › approximation theory
polynomial approximation |
0.7 | 1 | 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial Approximations · J. Mach. Learn. Res. 2023 |
Mathematical optimization › sparse optimization
sparse approximation |
0.7 | 1 | 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial Approximations · J. Mach. Learn. Res. 2023 |
Computer vision › Image recognition and object detection › image classification
fine-grained image classification |
0.2 | 1 | 2015 | Evaluation of output embeddings for fine-grained image classification · CVPR 2015 |
Machine learning › Transfer learning and domain adaptation
zero-shot learning |
0.2 | 1 | 2015 | Evaluation of output embeddings for fine-grained image classification · CVPR 2015 |
Computer vision › Vision and language › cross-modal alignment
visual-semantic embedding |
0.1 | 1 | 2015 | Evaluation of output embeddings for fine-grained image classification · CVPR 2015 |
Methods — techniques the papers use, named apart from their topics
proximal point method · 0.7l1 penalty · 0.7graph-theoretic algorithms · 0.7unsupervised text embedding · 0.2compatibility function learning · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Learning Optimal Feedback Operators and their Sparse Polynomial ApproximationsabstractA learning based method for obtaining feedback laws for nonlinear optimal control problems is proposed. The learning problem is posed such that the open loop value function is its optimal solution. This infinite dimensional, function space, problem, is approximated by a polynomial ansatz and its convergence is analyzed. An $\ell_1$ penalty term is employed, which combined with the proximal point method, allows to find sparse solutions for the learning problem. The approach requires multiple evaluations of the elements of the polynomial basis and of their derivatives. In order to do this efficiently a graph-theoretic algorithm is devised. Several examples underline that the proposed methodology provides a promising approach for mitigating the curse of dimensionality which would be involved in case the optimal feedback law was obtained by solving the Hamilton Jacobi Bellman equation. Karl Kunisch, Donato Vásquez-Varas, Daniel Walter |
J. Mach. Learn. Res. | 3 |
| 2015 | Evaluation of output embeddings for fine-grained image classificationabstractImage classification has advanced significantly in recent years with the availability of large-scale image sets. However, fine-grained classification remains a major challenge due to the annotation cost of large numbers of fine-grained categories. This project shows that compelling classification performance can be achieved on such categories even without labeled training data. Given image and class embeddings, we learn a compatibility function such that matching embeddings are assigned a higher score than mismatching ones; zero-shot classification of an image proceeds by finding the label yielding the highest joint compatibility score. We use state-of-the-art image features and focus on different supervised attributes and unsupervised output embeddings either derived from hierarchies or learned from unlabeled text corpora. We establish a substantially improved state-of-the-art on the Animals with Attributes and Caltech-UCSD Birds datasets. Most encouragingly, we demonstrate that purely unsupervised output embeddings (learned from Wikipedia and improved with finegrained text) achieve compelling results, even outperforming the previous supervised state-of-the-art. By combining different output embeddings, we further improve results. Zeynep Akata, Scott E. Reed, Daniel Walter, Honglak Lee, Bernt Schiele |
CVPR | 3 |