An approximate IPTR framework for linearly constrained optimization uses low-rank projector updates to cut per-iteration cost while preserving feasibility and convergence guarantees, with experiments showing 2.48x speedup.
2024.102379
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
N-gram models equipped with a dynamic promotion ensemble match or exceed the accuracy of neural networks for next-activity prediction in event logs while using substantially fewer resources.
citing papers explorer
-
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
An approximate IPTR framework for linearly constrained optimization uses low-rank projector updates to cut per-iteration cost while preserving feasibility and convergence guarantees, with experiments showing 2.48x speedup.
-
Promoting Simple Agents: Ensemble Methods for Event-Log Prediction
N-gram models equipped with a dynamic promotion ensemble match or exceed the accuracy of neural networks for next-activity prediction in event logs while using substantially fewer resources.