Imagen de Portada

HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cotnareanu, Joseph, Zhang, Zhanguang, Zhen, Hui-Ling, Zhang, Yingxue, Coates, Mark
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Balanced Neuro-Symbolic Approach for Commonsense Abductive Logic
por: Cotnareanu, Joseph, et al.
Publicado: (2026)

GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
por: Zhang, Zhanguang, et al.
Publicado: (2024)

SATformer: Transformer-Based UNSAT Core Learning
por: Shi, Zhengyuan, et al.
Publicado: (2022)

HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
por: Li, Yang, et al.
Publicado: (2023)

CKGConv: General Graph Convolution with Continuous Kernels
por: Ma, Liheng, et al.
Publicado: (2024)

InnerThoughts: Disentangling Representations and Predictions in Large Language Models
por: Chételat, Didier, et al.
Publicado: (2025)

On Size and Hardness Generalization in Unsupervised Learning for the Travelling Salesman Problem
por: Min, Yimeng, et al.
Publicado: (2024)

Abductive Reasoning with Probabilistic Commonsense
por: Cotnareanu, Joseph, et al.
Publicado: (2026)

Verifier-Backed Hard Problem Generation for Mathematical Reasoning
por: Lai, Yuhang, et al.
Publicado: (2026)

How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning
por: Chen, Jiangwei, et al.
Publicado: (2026)

UNSAT Solver Synthesis via Monte Carlo Forest Search
por: Cameron, Chris, et al.
Publicado: (2022)

DyG2Vec: Efficient Representation Learning for Dynamic Graphs
por: Alomrani, Mohammad Ali, et al.
Publicado: (2022)

The Graph's Apprentice: Teaching an LLM Low Level Knowledge for Circuit Quality Estimation
por: Moravej, Reza, et al.
Publicado: (2024)

Sparse Decomposition of Graph Neural Networks
por: Hu, Yaochen, et al.
Publicado: (2024)

Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem
por: Chen, Jingxiao, et al.
Publicado: (2024)

Self-Improving Transformers Overcome Easy-to-Hard and Length Generalization Challenges
por: Lee, Nayoung, et al.
Publicado: (2025)

HardNet: Hard-Constrained Neural Networks with Universal Approximation Guarantees
por: Min, Youngjae, et al.
Publicado: (2024)

Enhancing Anomaly Detection via Generating Diversified and Hard-to-distinguish Synthetic Anomalies
por: Kim, Hyuntae, et al.
Publicado: (2024)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
por: Nagda, Ansh, et al.
Publicado: (2025)

Exploring Query Efficient Data Generation towards Data-free Model Stealing in Hard Label Setting
por: Pei, Gaozheng, et al.
Publicado: (2024)

NPG-Muse: Scaling Long Chain-of-Thought Reasoning with NP-Hard Graph Problems
por: Wang, Yuyao, et al.
Publicado: (2025)

Constrained Posterior Sampling: Time Series Generation with Hard Constraints
por: Narasimhan, Sai Shankar, et al.
Publicado: (2024)

Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervision
por: Sun, Zhiqing, et al.
Publicado: (2024)

Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs
por: Alomrani, Mohammad Ali, et al.
Publicado: (2025)

Graph Knowledge Distillation to Mixture of Experts
por: Rumiantsev, Pavel, et al.
Publicado: (2024)

Self-Mined Hardness for Safety Fine-Tuning
por: Gupta, Prakhar, et al.
Publicado: (2026)

Synthetic Data Generation for Augmenting Small Samples
por: Liu, Dan, et al.
Publicado: (2025)

POPE: Learning to Reason on Hard Problems via Privileged On-Policy Exploration
por: Qu, Yuxiao, et al.
Publicado: (2026)

The Unreasonable Effectiveness of Easy Training Data for Hard Tasks
por: Hase, Peter, et al.
Publicado: (2024)

On the Hardness of Computing Counterfactual and Semifactual Explanations in XAI
por: Artelt, André, et al.
Publicado: (2026)

MoMaGen: Generating Demonstrations under Soft and Hard Constraints for Multi-Step Bimanual Mobile Manipulation
por: Li, Chengshu, et al.
Publicado: (2025)

Enhancing CTR Prediction in Recommendation Domain with Search Query Representation
por: Wang, Yuening, et al.
Publicado: (2024)

From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline
por: Li, Tianle, et al.
Publicado: (2024)

Understanding Hardness of Vision-Language Compositionality from A Token-level Causal Lens
por: Chen, Ziliang, et al.
Publicado: (2025)

Easy2Hard-Bench: Standardized Difficulty Labels for Profiling LLM Performance and Generalization
por: Ding, Mucong, et al.
Publicado: (2024)

Soft Tokens, Hard Truths
por: Butt, Natasha, et al.
Publicado: (2025)

Generative Augmented Inference
por: Lu, Cheng, et al.
Publicado: (2026)

Language Models Do Hard Arithmetic Tasks Easily and Hardly Do Easy Arithmetic Tasks
por: Gambardella, Andrew, et al.
Publicado: (2024)

HardML: A Benchmark For Evaluating Data Science And Machine Learning knowledge and reasoning in AI
por: Pricope, Tidor-Vlad
Publicado: (2025)

Curriculum Reinforcement Learning from Easy to Hard Tasks Improves LLM Reasoning
por: Parashar, Shubham, et al.
Publicado: (2025)