Cover Image

Model Stealing for Any Low-Rank Language Model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Allen, Moitra, Ankur
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)

Learning $\mathsf{AC}^0$ Under Graphical Models
by: Chandrasekaran, Gautam, et al.
Published: (2026)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives
by: Moitra, Ankur, et al.
Published: (2026)

Steering diffusion models with quadratic rewards: a fine-grained analysis
by: Moitra, Ankur, et al.
Published: (2026)

Structure learning of Hamiltonians from real-time evolution
by: Bakshi, Ainesh, et al.
Published: (2024)

Learning quantum Hamiltonians at any temperature in polynomial time
by: Bakshi, Ainesh, et al.
Published: (2023)

Overcomplete Tensor Decomposition via Koszul-Young Flattenings
by: Kothari, Pravesh K., et al.
Published: (2024)

Provably Extracting the Features from a General Superposition
by: Liu, Allen
Published: (2025)

Approximate Lifted Model Construction
by: Luttermann, Malte, et al.
Published: (2025)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
by: Li, Shuyao, et al.
Published: (2024)

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

Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
by: Rohatgi, Dhruv, et al.
Published: (2025)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
by: Golowich, Noah, et al.
Published: (2024)

Efficient Diffusion Models for Symmetric Manifolds
by: Mangoubi, Oren, et al.
Published: (2025)

Differentially Private Kernel Density Estimation
by: Liu, Erzhi, et al.
Published: (2024)

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

Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
by: Vahidi, Soroush, et al.
Published: (2024)

Discovering Data Structures: Nearest Neighbor Search and Beyond
by: Salemohamed, Omar, et al.
Published: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
by: Huisman, Tim, et al.
Published: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
by: Sun, Yiwen, et al.
Published: (2024)

Mini-Batch Kernel $k$-means
by: Jourdan, Ben, et al.
Published: (2024)

Block-Diagonal Guided DBSCAN Clustering
by: Zhao, Weibing
Published: (2024)

Contract Scheduling with Distributional and Multiple Advice
by: Angelopoulos, Spyros, et al.
Published: (2024)

SubGen: Token Generation in Sublinear Time and Memory
by: Zandieh, Amir, et al.
Published: (2024)

Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)

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

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

Learning-Augmented Priority Queues
by: Benomar, Ziyad, et al.
Published: (2024)

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

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

Non-clairvoyant Scheduling with Partial Predictions
by: Benomar, Ziyad, et al.
Published: (2024)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
by: de Luca, Artur Back, et al.
Published: (2024)

Mini-batch Submodular Maximization
by: Schwartzman, Gregory
Published: (2024)

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

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

A Note On Lookahead In Real Life And Computing
by: Sharma, Burle, et al.
Published: (2024)

Simulation of Graph Algorithms with Looped Transformers
by: de Luca, Artur Back, et al.
Published: (2024)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
by: Yao, Jasper
Published: (2025)