Faezeh Faez

ORCID: 0000-0003-0082-8337
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Neural Networks
  • Topic Modeling
  • Formal Methods in Verification
  • Machine Learning in Materials Science
  • Graph Theory and Algorithms
  • Data Quality and Management
  • Embedded Systems Design Techniques
  • Text and Document Classification Technologies
  • Parallel Computing and Optimization Techniques
  • Model-Driven Software Engineering Techniques
  • Evolutionary Algorithms and Applications
  • Logic, programming, and type systems
  • Dementia and Cognitive Impairment Research
  • Scientific Computing and Data Management

Huawei Technologies (Canada)
2025

Sharif University of Technology
2020-2022

Deep generative models have achieved great success in areas such as image, speech, and natural language processing the past few years. Thanks to advances graph-based deep learning, particular graph representation generation methods recently emerged with new applications ranging from discovering novel molecular structures modeling social networks. This paper conducts a comprehensive survey on learning-based approaches classifies them into five broad categories, namely, autoregressive,...

10.1109/access.2021.3098417 article EN cc-by IEEE Access 2021-01-01

10.1145/3658617.3697721 article EN Proceedings of the 28th Asia and South Pacific Design Automation Conference 2025-01-20

Graph data structures are fundamental for studying connected entities. With an increase in the number of applications where is represented as graphs, problem graph generation has recently become a hot topic. However, despite its significance, conditional that creates graphs with desired features relatively less explored previous studies. This paper addresses class-conditional uses class labels constraints by introducing Class Conditioned Generator (CCGG). We built CCGG injecting information...

10.1145/3487553.3524721 article EN Companion Proceedings of the The Web Conference 2018 2022-04-25

Deep learning-based graph generation approaches have remarkable capacities for data modeling, allowing them to solve a wide range of real-world problems. Making these methods able consider different conditions during the procedure even increases their effectiveness by empowering generate new samples that meet desired criteria. This paper presents conditional deep method called SCGG considers particular type structural conditions. Specifically, our proposed model takes an initial subgraph and...

10.1371/journal.pone.0277887 article EN cc-by PLoS ONE 2022-11-21

Missing data is unavoidable in graphs, which can significantly affect the accuracy of downstream tasks. Many methods have been proposed to mitigate missing partially observed graphs. Most these approaches assume they complete access graph nodes and only focus on recovering links, while practice a part also be out access. This work presents Deep Node Predictor (DMNP), novel deep learning-based approach partly Our does not rely additional information that many cases exist. We compare our model...

10.1109/asonam55673.2022.10068642 article EN 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) 2022-11-10

Temporal Graph Neural Networks have garnered substantial attention for their capacity to model evolving structural and temporal patterns while exhibiting impressive performance. However, it is known that these architectures are encumbered by issues constrain performance, such as over-squashing over-smoothing. Meanwhile, Transformers demonstrated exceptional computational effectively address challenges related long-range dependencies. Consequently, we introduce Todyformer-a novel...

10.48550/arxiv.2402.05944 preprint EN arXiv (Cornell University) 2024-02-02

Electronic Design Automation (EDA) is essential for IC design and has recently benefited from AI-based techniques to improve efficiency. Logic synthesis, a key EDA stage, transforms high-level hardware descriptions into optimized netlists. Recent research employed machine learning predict Quality of Results (QoR) pairs And-Inverter Graphs (AIGs) synthesis recipes. However, the severe scarcity data due very limited number available AIGs results in overfitting, significantly hindering...

10.48550/arxiv.2409.06077 preprint EN arXiv (Cornell University) 2024-09-09

Contemporary hardware design benefits from the abstraction provided by high-level logic gates, streamlining implementation of circuits. Logic Synthesis Optimization (LSO) operates at one level within Electronic Design Automation (EDA) workflow, targeting improvements in circuits with respect to performance metrics such as size and speed final layout. Recent trends field show a growing interest leveraging Machine Learning (ML) for EDA, notably through ML-guided synthesis utilizing...

10.48550/arxiv.2409.10653 preprint EN arXiv (Cornell University) 2024-09-16

Deep generative models have achieved great success in areas such as image, speech, and natural language processing the past few years. Thanks to advances graph-based deep learning, particular graph representation generation methods recently emerged with new applications ranging from discovering novel molecular structures modeling social networks. This paper conducts a comprehensive survey on learning-based approaches classifies them into five broad categories, namely, autoregressive,...

10.48550/arxiv.2012.15544 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Deep learning-based graph generation approaches have remarkable capacities for data modeling, allowing them to solve a wide range of real-world problems. Making these methods able consider different conditions during the procedure even increases their effectiveness by empowering generate new samples that meet desired criteria. This paper presents conditional deep method called SCGG considers particular type structural conditions. Specifically, our proposed model takes an initial subgraph and...

10.48550/arxiv.2209.09681 preprint EN other-oa arXiv (Cornell University) 2022-01-01
Coming Soon ...