Antonios Valkanas

Antonios Valkanas

Auto-generated profile, based on publicly available information

Antonios Valkanas

McGill University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 August 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
BOBoris Oreshkin
Boris Oreshkin
AVAntonios Valkanas
Antonios Valkanas
FHFélix G. Harvey
Félix G. Harvey
LMLouis-Simon Ménard
Louis-Simon Ménard
FBFlorent Bocquelet
Florent Bocquelet
MCMark J. Coates
Mark J. Coates
We show that the task of synthesizing human motion conditioned on a set of key frames can be solved more accurately and effectively if a deep learning based interpolator operates in the delta mode using the spherical linear interpolator as a baseline. We empirically demonstrate the strength of our approach on publicly available datasets achieving state-of-the-art performance. We further generalize these results by showing that the $\Delta$ -regime is viable with respect to the reference of the last known frame (also known as the zero-velocity model). This supports the more general conclusion that operating in the reference frame local to input frames is more accurate and robust than in the global (world) reference frame advocated in previous work. Our code is publicly available at: https://github.com/boreshkinai/delta-interpolator .

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YWYuening Wang
Yuening Wang
YZYingxue Zhang
Yingxue Zhang
AVAntonios Valkanas
Antonios Valkanas
RTRuiming Tang
Ruiming Tang
CMChen Ma
Chen Ma
MCMark Coates
Mark Coates
Recommender systems now consume large-scale data and play a significant role in improving user experience. Graph Neural Networks (GNNs) have emerged as one of the most effective recommender system models because they model the rich relational information. The ever-growing volume of data can make training GNNs prohibitively expensive. To address this, previous attempts propose to train the GNN models incrementally as new data blocks arrive. Feature and structure knowledge distillation techniques have been explored to allow the GNN model to train in a fast incremental fashion while alleviating the catastrophic forgetting problem. However, preserving the same amount of the historical information for all users is sub-optimal since it fails to take into account the dynamics of each user's change of preferences. For the users whose interests shift substantially, retaining too much of the old knowledge can overly constrain the model, preventing it from quickly adapting to the users’ novel interests. In contrast, for users who have static preferences, model performance can benefit greatly from preserving as much of the user's long-term preferences as possible. In this work, we propose a novel training strategy that adaptively learns personalized imitation weights for each user to balance the contribution from the recent data and the amount of knowledge to be distilled from previous time periods. We demonstrate the effectiveness of learning imitation weights via a comparison on five diverse datasets for three state-of-art structure distillation based recommender systems. The performance shows consistent improvement over competitive incremental learning techniques.

8 December 2023 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
SPSoumyasundar Pal
Soumyasundar Pal
AVAntonios Valkanas
Antonios Valkanas
MCMark Coates
Mark Coates
Adaptive importance sampling (AIS) methods provide a useful alternative to Markov Chain Monte Carlo (MCMC) algorithms for performing inference of intractable distributions. Population Monte Carlo (PMC) algorithms constitute a family of AIS approaches which adapt the proposal distributions iteratively to improve the approximation of the target distribution. Recent work in this area primarily focuses on ameliorating the proposal adaptation procedure for high-dimensional applications. However, most of the AIS algorithms use simple proposal distributions for sampling, which might be inadequate in exploring target distributions with intricate geometries. In this work, we construct expressive proposal distributions in the AIS framework using normalizing flow, an appealing approach for modeling complex distributions. We use an iterative parameter update rule to enhance the approximation of the target distribution. Numerical experiments show that in high-dimensional settings, the proposed algorithm offers significantly improved performance compared to the existing techniques.

9 October 2019 in IETE Journal of Education
Verified
Journal Article
Closed access
AVAntonios Valkanas
Antonios Valkanas
DPDivyanshu Pandey
Divyanshu Pandey
Harry LeibHarry Leib
Harry Leib
Working with the abstract concepts of signals in time and frequency domains without a concrete tool to understand the very nature of these fundamental concepts has been a major impediment for undergraduate engineering students attending a course on Signals and Systems or Communications. Classroom teaching in such courses has been traditionally confined to working out the mathematics behind the concepts. Hence a tool is needed that allows students to explore the actual radio spectrum leading to a real appreciation of the subject matter. This paper considers the use of a low-cost RTL-SDR as an educational tool to address this difficulty. The approach presented can be used for in-class demonstrations and at-home activities aiding in a better understanding of the nature of signals in time and frequency domains. RTL-SDR can allow students to explore the radio spectrum on their own in an easy, cost-effective and academically enriching manner.

16 August 2022 in arXiv
Verified
Preprint
Open access
PDF file
BOBoris Oreshkin
Boris Oreshkin
AVAntonios Valkanas
Antonios Valkanas
FHFélix G. Harvey
Félix G. Harvey
LMLouis-Simon Ménard
Louis-Simon Ménard
FBFlorent Bocquelet
Florent Bocquelet
MCMark J. Coates
Mark J. Coates
We show that the task of synthesizing human motion conditioned on a set of key frames can be solved more accurately and effectively if a deep learning based interpolator operates in the delta mode using the spherical linear interpolator as a baseline. We empirically demonstrate the strength of our approach on publicly available datasets achieving state-of-the-art performance. We further generalize these results by showing that the $\Delta$-regime is viable with respect to the reference of the last known frame (also known as the zero-velocity model). This supports the more general conclusion that operating in the reference frame local to input frames is more accurate and robust than in the global (world) reference frame advocated in previous work. Our code is publicly available at https://github.com/boreshkinai/delta-interpolator.

2 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
YWYuening Wang
Yuening Wang
YZYingxue Zhang
Yingxue Zhang
AVAntonios Valkanas
Antonios Valkanas
RTRuiming Tang
Ruiming Tang
CMChen Ma
Chen Ma
MCMark Coates
Mark Coates
Recommender systems now consume large-scale data and play a significant role in improving user experience. Graph Neural Networks (GNNs) have emerged as one of the most effective recommender system models because they model the rich relational information. The ever-growing volume of data can make training GNNs prohibitively expensive. To address this, previous attempts propose to train the GNN models incrementally as new data blocks arrive. Feature and structure knowledge distillation techniques have been explored to allow the GNN model to train in a fast incremental fashion while alleviating the catastrophic forgetting problem. However, preserving the same amount of the historical information for all users is sub-optimal since it fails to take into account the dynamics of each user's change of preferences. For the users whose interests shift substantially, retaining too much of the old knowledge can overly constrain the model, preventing it from quickly adapting to the users' novel interests. In contrast, for users who have static preferences, model performance can benefit greatly from preserving as much of the user's long-term preferences as possible. In this work, we propose a novel training strategy that adaptively learns personalized imitation weights for each user to balance the contribution from the recent data and the amount of knowledge to be distilled from previous time periods. We demonstrate the effectiveness of learning imitation weights via a comparison on five diverse datasets for three state-of-art structure distillation based recommender systems. The performance shows consistent improvement over competitive incremental learning techninques.