World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
5209
World Ranking
12599
National Ranking
169

Overview

Vincent Y. F. Tan is affiliated with the National University of Singapore in Singapore. Their research primarily spans the field of Computer Science, with a focus on Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Electrical and Electronic Engineering, and Computer Vision and Pattern Recognition.

The scientist's research encompasses several key topics including Advanced Bandit Algorithms Research, Wireless Communication Security Techniques, Machine Learning and Algorithms, Distributed Sensor Networks and Detection Algorithms, Adversarial Robustness in Machine Learning, Age of Information Optimization, and DNA and Biological Computing.

Vincent Y. F. Tan has authored numerous papers, including recent publications such as "Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning" (2022) published in the 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), "Efficient Sharpness-aware Minimization for Improved Training of Neural Networks" (2021) in arXiv (Cornell University), "On Exact and ∞-Rényi Common Informations" (2020) in IEEE Transactions on Information Theory, "Common Information, Noise Stability, and Their Extensions" (2022) in Foundations and Trends® in Communications and Information Theory, and "A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem" (2024) in the European Journal of Operational Research.

Frequent coauthors of Vincent Y. F. Tan include Jiashi Feng, Qiaosheng Zhang, Yonglong Li, P. N. Karthik, and Hanshu Yan.

The scientist has published extensively in venues such as arXiv (Cornell University), IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing, Proceedings of the AAAI Conference on Artificial Intelligence, and the 2022 IEEE International Symposium on Information Theory (ISIT).

  • Artificial Intelligence
  • Management Science and Operations Research
  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Computer Vision and Pattern Recognition

  • Advanced Bandit Algorithms Research
  • Wireless Communication Security Techniques
  • Machine Learning and Algorithms
  • Distributed Sensor Networks and Detection Algorithms
  • Adversarial Robustness in Machine Learning
  • Age of Information Optimization
  • DNA and Biological Computing

  • Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning (2022), 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
  • Efficient Sharpness-aware Minimization for Improved Training of Neural Networks (2021), arXiv (Cornell University)
  • On Exact and ∞-Rényi Common Informations (2020), IEEE Transactions on Information Theory
  • Common Information, Noise Stability, and Their Extensions (2022), Foundations and Trends® in Communications and Information Theory
  • A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem (2024), European Journal of Operational Research

  • Jiashi Feng
  • Qiaosheng Zhang
  • Yonglong Li
  • P. N. Karthik
  • Hanshu Yan

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • IEEE Transactions on Signal Processing
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • 2022 IEEE International Symposium on Information Theory (ISIT)

Best Publications

  • Beyond atopy: Multiple patterns of sensitization in relation to asthma in a birth cohort study

    Angela Simpson;Vincent Y. F. Tan;John Winn;Markus Svensén

  • Automatic Relevance Determination in Nonnegative Matrix Factorization with the $(eta)$-Divergence

    V. Y. F. Tan;C. Fevotte

  • Learning Latent Tree Graphical Models

    Myung Jin Choi;Vincent Y. F. Tan;Animashree Anandkumar;Alan S. Willsky

  • Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities

    Vincent Y. F. Tan

  • The Third-Order Term in the Normal Approximation for the AWGN Channel

    Vincent Yan Fu Tan;Marco Tomamichel

  • On the Dispersions of Three Network Information Theory Problems

    Vincent Y. F. Tan;Oliver Kosut

  • High-dimensional structure estimation in Ising models: Local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • High-dimensional Gaussian graphical model selection: walk summability and local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • DragDiffusion: Harnessing Diffusion Models for Interactive Point-Based Image Editing

    Unknown

  • A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels

    Marco Tomamichel;Vincent Y. F. Tan

  • A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures

    Vincent Y F Tan;Animashree Anandkumar;Lang Tong;Alan S Willsky

  • Time-Division is Optimal for Covert Communication Over Some Broadcast Channels

    Vincent Y. F. Tan;Si-Hyeon Lee

  • Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

    Shun Watanabe;Shigeaki Kuzuoka;Vincent Y. F. Tan

  • Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning

    Unknown

  • Wireless Compressive Sensing for Energy Harvesting Sensor Nodes

    Gang Yang;Vincent Y. F. Tan;Chin Keong Ho;See Ho Ting

  • Automatic Relevance Determination in Nonnegative Matrix Factorization

    Vincent Y. F. Tan;Cédric Févotte

  • Hypothesis testing under maximal leakage privacy constraints

    Jiachun Liao;Lalitha Sankar;Flavio P. Calmon;Vincent Y. F. Tan

  • Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels

    Marco Tomamichel;Marco Tomamichel;Vincent Y. F. Tan

  • Moderate deviation analysis for classical communication over quantum channels

    Christopher T. Chubb;Vincent Y. F. Tan;Marco Tomamichel

  • Minimizing the Accumulated Trajectory Error to Improve Dataset Distillation

    Unknown

  • Codes in the Space of Multisets—Coding for Permutation Channels With Impairments

    Mladen Kovacevic;Vincent Y. F. Tan

  • Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm

    V.Y.F. Tan;V.K. Goyal

  • Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures

    Vincent Y F Tan;Animashree Anandkumar;Alan S Willsky

  • Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems

    Mladen Kovacevic;Vincent Y. F. Tan

  • Hypothesis Testing Under Mutual Information Privacy Constraints in the High Privacy Regime

    Jiachun Liao;Lalitha Sankar;Vincent Y. F. Tan;Flavio du Pin Calmon

  • High-dimensional structure estimation in Ising models: Local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • On Robustness of Neural Ordinary Differential Equations

    Hanshu Yan;Jiawei Du;Vincent Y. F. Tan;Jiashi Feng

  • Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information

    Shun Watanabe;Shigeaki Kuzuoka;Vincent Y. F. Tan

Frequent Co-Authors

Mehul Motani
Mehul Motani National University of Singapore
Anima Anandkumar
Anima Anandkumar Nvidia (United Kingdom)
Stark C. Draper
Stark C. Draper University of Toronto
Masahito Hayashi
Masahito Hayashi Chinese University of Hong Kong, Shenzhen
Lav R. Varshney
Lav R. Varshney University of Illinois at Urbana-Champaign
Cédric Févotte
Cédric Févotte Toulouse Institute of Computer Science Research
Ashish Khisti
Ashish Khisti University of Toronto
Jiashi Feng
Jiashi Feng ByteDance
Changho Suh
Changho Suh Korea Advanced Institute of Science and Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a variety of high-demand fields and flexible learning options. Many students are interested in finding an affordable data science degree that delivers real value without burdening them with excessive debt. These programs often offer online and part-time formats to fit busy schedules.

If you’re considering a technical focus, an online bachelor’s in electrical engineering can be a great pathway. These degrees offer strong job outlooks and robust salary potential, particularly in fields like hardware, communications, and renewable energy.

For those seeking faster entry into tech, look at 3-month certificate programs that pay well. These short credentials can boost your resume and give you the skills needed for well-compensated roles in areas like IT support, cybersecurity, and data analytics.

If you already have a bachelor’s, it’s worth considering the quickest cheapest masters degree to accelerate your career advancement. Fast-track master’s programs allow you to specialize and increase your earning potential in less time.

Best Scientists Citing Vincent Y. F. Tan

Trending Scientists

Recently Published Articles