Pei Huang

Orcid: 0000-0002-2989-5624

Affiliations:
  • Stanford University, Palo Alto, CA, USA
  • Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science, Beijing, China (former)


According to our database1, Pei Huang authored at least 25 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A prompt-based approach to adversarial example generation and robustness enhancement.
Frontiers Comput. Sci., August, 2024

Are your apps accessible? A GCN-based accessibility checker for low vision users.
Inf. Softw. Technol., 2024

Parallel Verification for δ-Equivalence of Neural Network Quantization.
Proceedings of the AI Verification - First International Symposium, 2024

PAD: A Robustness Enhancement Ensemble Method via Promoting Attention Diversity.
Proceedings of the 2024 Joint International Conference on Computational Linguistics, 2024

Marabou 2.0: A Versatile Formal Analyzer of Neural Networks.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Towards Efficient Verification of Quantized Neural Networks.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A Dual Prompt Learning Framework for Few-Shot Dialogue State Tracking.
Proceedings of the ACM Web Conference 2023, 2023

Investigating the Existence of Holey Latin Squares via Satisfiability Testing.
Proceedings of the PRICAI 2023: Trends in Artificial Intelligence, 2023

Quantifying Robustness to Adversarial Word Substitutions.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Suggesting Variable Order for Cylindrical Algebraic Decomposition via Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

NRAgo: Solving SMT(NRA) Formulas with Gradient-Based Optimization.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

PSMT: Satisfiability Modulo Theories Meets Probability Distribution.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

Improving Bit-Blasting for Nonlinear Integer Constraints.
Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis, 2023

Can Graph Neural Networks Learn to Solve the MaxSAT Problem? (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A Prompting-based Approach for Adversarial Example Generation and Robustness Enhancement.
CoRR, 2022

Quantifying Robustness to Adversarial Word Substitutions.
CoRR, 2022

ε-weakened robustness of deep neural networks.
Proceedings of the ISSTA '22: 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, Virtual Event, South Korea, July 18, 2022

Word Level Robustness Enhancement: Fight Perturbation with Perturbation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Can Graph Neural Networks Learn to Solve MaxSAT Problem?
CoRR, 2021

Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Approximating Integer Solution Counting via Space Quantification for Linear Constraints.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018


  Loading...