Imagen de Portada

The Theory and Practice of MAP Inference over Non-Convex Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kurscheidt, Leander, Masina, Gabriele, Sebastiani, Roberto, Vergari, Antonio
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Probabilistic Neuro-symbolic Layer for Algebraic Constraint Satisfaction
por: Kurscheidt, Leander, et al.
Publicado: (2025)

Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories
por: Masina, Gabriele, et al.
Publicado: (2025)

Even More Guarantees for Variational Inference in the Presence of Symmetries
por: Zellinger, Lena, et al.
Publicado: (2026)

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
por: Civini, Emanuele, et al.
Publicado: (2026)

Canonical Decision Diagrams Modulo Theories
por: Michelutti, Massimo, et al.
Publicado: (2024)

On CNF Conversion for SAT and SMT Enumeration
por: Masina, Gabriele, et al.
Publicado: (2023)

On Faster Marginalization with Squared Circuits via Orthonormalization
por: Loconte, Lorenzo, et al.
Publicado: (2024)

Taming the Sigmoid Bottleneck: Provably Argmaxable Sparse Multi-Label Classification
por: Grivas, Andreas, et al.
Publicado: (2023)

How to Approximate Inference with Subtractive Mixture Models
por: Zellinger, Lena, et al.
Publicado: (2026)

An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale
por: Javaloy, Adrián, et al.
Publicado: (2026)

ReMAP: Neural Reparameterization for Scalable MAP Inference in Arbitrary-Order Markov Random Fields
por: Wang, Yaomin, et al.
Publicado: (2024)

Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints
por: Yang, Ming, et al.
Publicado: (2025)

How to Square Tensor Networks and Circuits Without Squaring Them
por: Loconte, Lorenzo, et al.
Publicado: (2025)

COPA: Comparing the incomparable in multi-objective model evaluation
por: Javaloy, Adrián, et al.
Publicado: (2025)

Towards Logically Consistent Language Models via Probabilistic Reasoning
por: Calanzone, Diego, et al.
Publicado: (2024)

Set-based Implicit Likelihood Inference of Galaxy Cluster Mass
por: Wang, Bonny Y., et al.
Publicado: (2025)

Probabilistic ML Verification via Weighted Model Integration
por: Morettin, Paolo, et al.
Publicado: (2024)

Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces
por: Roknilamouki, Amirhossein, et al.
Publicado: (2025)

Logically Consistent Language Models via Neuro-Symbolic Integration
por: Calanzone, Diego, et al.
Publicado: (2024)

Scalable Expectation Estimation with Subtractive Mixture Models
por: Zellinger, Lena, et al.
Publicado: (2025)

Simulation-Efficient Cosmological Inference with Multi-Fidelity SBI
por: Thiele, Leander, et al.
Publicado: (2025)

Neurosymbolic Diffusion Models
por: van Krieken, Emile, et al.
Publicado: (2025)

Neurosymbolic Reasoning Shortcuts under the Independence Assumption
por: van Krieken, Emile, et al.
Publicado: (2025)

Smooth Quasar-Convex Optimization with Constraints
por: Martínez-Rubio, David
Publicado: (2025)

A Convex Framework for Confounding Robust Inference
por: Ishikawa, Kei, et al.
Publicado: (2023)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
por: Dahal, Hari, et al.
Publicado: (2023)

Can LLMs Compress (and Decompress)? Evaluating Code Understanding and Execution via Invertibility
por: Maveli, Nickil, et al.
Publicado: (2026)

Can VLMs Reason Robustly? A Neuro-Symbolic Investigation
por: Chen, Weixin, et al.
Publicado: (2026)

Sum of Squares Circuits
por: Loconte, Lorenzo, et al.
Publicado: (2024)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
por: Liu, Xiufeng, et al.
Publicado: (2026)

Enhancing SMT-based Weighted Model Integration by Structure Awareness
por: Spallitta, Giuseppe, et al.
Publicado: (2023)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

RAYEN: Imposition of Hard Convex Constraints on Neural Networks
por: Tordesillas, Jesus, et al.
Publicado: (2023)

Probabilistic Circuits with Constraints via Convex Optimization
por: Ghandi, Soroush, et al.
Publicado: (2024)

Bayesian Cosmic Void Finding with Graph Flows
por: Thiele, Leander
Publicado: (2026)

Scaling Continuous Latent Variable Models as Probabilistic Integral Circuits
por: Gala, Gennaro, et al.
Publicado: (2024)

How to Turn Your Knowledge Graph Embeddings into Generative Models
por: Loconte, Lorenzo, et al.
Publicado: (2023)

A Practical Approach to Causal Inference over Time
por: Cinquini, Martina, et al.
Publicado: (2024)

Optimal Scheduling Algorithms for LLM Inference: Theory and Practice
por: Bari, Agrim, et al.
Publicado: (2025)