Copertina

Approximate Lifted Model Construction

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Luttermann, Malte, Speller, Jan, Gehrke, Marcel, Braun, Tanya, Möller, Ralf, Hartwig, Mattis
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Artificial Intelligence Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Lifted Causal Inference in Relational Domains
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
di: Luttermann, Malte, et al.
Pubblicazione: (2026)

Efficient Detection of Commutative Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Efficient Detection of Exchangeable Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Lifted Model Construction without Normalisation: A Vectorised Approach to Exploit Symmetries in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Compression versus Accuracy: A Hierarchy of Lifted Models
di: Speller, Jan, et al.
Pubblicazione: (2025)

Lifting Factor Graphs with Some Unknown Factors
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Lifting Factor Graphs with Some Unknown Factors for New Individuals
di: Luttermann, Malte, et al.
Pubblicazione: (2025)

Towards Privacy-Preserving Relational Data Synthesis via Probabilistic Relational Models
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Streaming Attention Approximation via Discrepancy Theory
di: Kochetkova, Ekaterina, et al.
Pubblicazione: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
di: McMahan, Jeremy
Pubblicazione: (2025)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
di: Harris, Blake, et al.
Pubblicazione: (2024)

Constructing Decision Trees from Data Streams
di: Pham, Huy, et al.
Pubblicazione: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2024)

Model Stealing for Any Low-Rank Language Model
di: Liu, Allen, et al.
Pubblicazione: (2024)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
di: Wienöbst, Marcel, et al.
Pubblicazione: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
di: de Wynter, Adrian
Pubblicazione: (2020)

Provably Learning from Modern Language Models via Low Logit Rank
di: Golowich, Noah, et al.
Pubblicazione: (2025)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
di: Wienöbst, Marcel, et al.
Pubblicazione: (2022)

Limits of Approximating the Median Treatment Effect
di: Addanki, Raghavendra, et al.
Pubblicazione: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
di: Yau, Morris, et al.
Pubblicazione: (2023)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
di: Thejaswi, Suhas, et al.
Pubblicazione: (2024)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
di: Hosseininasab, Amin, et al.
Pubblicazione: (2022)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
di: Yao, Jasper
Pubblicazione: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
di: Li, Dongyue, et al.
Pubblicazione: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
di: Guan, Xinyu, et al.
Pubblicazione: (2025)

Online Learning with Probing for Sequential User-Centric Selection
di: Xu, Tianyi, et al.
Pubblicazione: (2025)

Demand Selection for VRP with Emission Quota
di: Najar, Farid, et al.
Pubblicazione: (2025)

Fast EXP3 Algorithms
di: Sato, Ryoma, et al.
Pubblicazione: (2025)

Provably Extracting the Features from a General Superposition
di: Liu, Allen
Pubblicazione: (2025)

Uncovering Fairness through Data Complexity as an Early Indicator
di: Ferreira, Juliett Suárez, et al.
Pubblicazione: (2025)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
di: Chee, Jerry, et al.
Pubblicazione: (2025)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
di: Brita, Catalin E., et al.
Pubblicazione: (2025)

Learning-Augmented Online Bipartite Fractional Matching
di: Choo, Davin, et al.
Pubblicazione: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
di: Bini, Lorenzo, et al.
Pubblicazione: (2025)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
di: Liu, Zhouyang, et al.
Pubblicazione: (2025)

On Tradeoffs in Learning-Augmented Algorithms
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
di: Chen, Wen-Ling, et al.
Pubblicazione: (2025)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
di: Ailon, Nir, et al.
Pubblicazione: (2025)