:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Min, Youngjae, Azizan, Navid
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence
Online Access:	https://arxiv.org/abs/2410.10807
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

HardNet++: Nonlinear Constraint Enforcement in Neural Networks
by: Goertzen, Andrea, et al.
Published: (2026)

SketchOGD: Memory-Efficient Continual Learning
by: Min, Youngjae, et al.
Published: (2023)

DAE-HardNet: A Physics Constrained Neural Network Enforcing Differential-Algebraic Hard Constraints
by: Golder, Rahul, et al.
Published: (2025)

HardFlow: Hard-Constrained Sampling for Flow-Matching Models via Trajectory Optimization
by: Li, Zeyang, et al.
Published: (2025)

SnareNet: Flexible Repair Layers for Neural Networks with Hard Constraints
by: Chu, Ya-Chi, et al.
Published: (2026)

On the Role of Transformer Feed-Forward Layers in Nonlinear In-Context Learning
by: Sun, Haoyuan, et al.
Published: (2025)

LMI-Net: Linear Matrix Inequality--Constrained Neural Networks via Differentiable Projection Layers
by: Tang, Sunbochen, et al.
Published: (2026)

ORFit: One-Pass Learning via Bridging Orthogonal Gradient Descent and Recursive Least-Squares
by: Min, Youngjae, et al.
Published: (2022)

Random Is Hard to Beat: Active Selection in online DPO with Modern LLMs
by: Oh, Giyeong, et al.
Published: (2026)

Tractable Uncertainty-Aware Meta-Learning
by: Park, Young-Jin, et al.
Published: (2022)

Quantifying Representation Reliability in Self-Supervised Learning Models
by: Park, Young-Jin, et al.
Published: (2023)

ECO: Energy-Constrained Operator Learning for Chaotic Dynamics with Boundedness Guarantees
by: Goertzen, Andrea, et al.
Published: (2025)

Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection
by: Julistiono, Addison Kristanto, et al.
Published: (2024)

Hard-Constrained Neural Networks with Physics-Embedded Architecture for Residual Dynamics Learning and Invariant Enforcement in Cyber-Physical Systems
by: Spotorno, Enzo Nicolás, et al.
Published: (2025)

Constrained Diffusion for Protein Design with Hard Structural Constraints
by: Christopher, Jacob K., et al.
Published: (2025)

Know What You Don't Know: Uncertainty Calibration of Process Reward Models
by: Park, Young-Jin, et al.
Published: (2025)

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

Advancing Constrained Monotonic Neural Networks: Achieving Universal Approximation Beyond Bounded Activations
by: Sartor, Davide, et al.
Published: (2025)

Efficient Multi-Adapter LLM Serving via Cross-Model KV-Cache Reuse with Activated LoRA
by: Li, Allison, et al.
Published: (2025)

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

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

HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
by: Cotnareanu, Joseph, et al.
Published: (2024)

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

HoP: Homeomorphic Polar Learning for Hard Constrained Optimization
by: Deng, Ke, et al.
Published: (2025)

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

More Consistent Accuracy PINN via Alternating Easy-Hard Training
by: Gao, Zhaoqian, et al.
Published: (2025)

Empirical Stability Analysis of Kolmogorov-Arnold Networks in Hard-Constrained Recurrent Physics-Informed Discovery
by: Spotorno, Enzo Nicolas, et al.
Published: (2026)

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

A Theoretical Analysis of Soft-Label vs Hard-Label Training in Neural Networks
by: Mandal, Saptarshi, et al.
Published: (2024)

Dynamic Universal Approximation Theory: Foundations for Parallelism in Neural Networks
by: Wang, Wei, et al.
Published: (2024)

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

Soft Tokens, Hard Truths
by: Butt, Natasha, et al.
Published: (2025)

Enhancing Adversarial Robustness of Deep Neural Networks Through Supervised Contrastive Learning
by: Wang, Longwei, et al.
Published: (2024)

GraphIP-Bench: How Hard Is It to Steal a Graph Neural Network, and Can We Stop It?
by: Zhao, Kaixiang, et al.
Published: (2026)

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

$λ$-GELU: Learning Gating Hardness for Controlled ReLU-ization in Deep Networks
by: Pérez-Corral, Cristian, et al.
Published: (2026)

Learning (Approximately) Equivariant Networks via Constrained Optimization
by: Manolache, Andrei, et al.
Published: (2025)

Physics-Constrained Flow Matching: Sampling Generative Models with Hard Constraints
by: Utkarsh, Utkarsh, et al.
Published: (2025)

SB-TRPO: Towards Safe Reinforcement Learning with Hard Constraints
by: Wagner, Dominik, et al.
Published: (2025)

Feed-Forward Neural Networks as a Mixed-Integer Program
by: Aftabi, Navid, et al.
Published: (2024)