Augury and Forerunner: Real‐Time Feedback Via Predictive Numerical Optimization and Input Prediction.
Saved in:
| Title: | Augury and Forerunner: Real‐Time Feedback Via Predictive Numerical Optimization and Input Prediction. |
|---|---|
| Authors: | Graus, J.1 (AUTHOR) jgraus@gmu.edu, Gingold, Y.2 (AUTHOR) ygingold@gmu.edu |
| Source: | Computer Graphics Forum. Sep2025, Vol. 44 Issue 6, p1-17. 17p. |
| Subjects: | Interactive computer systems, Constrained optimization, Operations research, Mathematical optimization, Trajectory optimization, Surrogate-based optimization |
| Abstract: | In many interactive systems, user input initializes and launches an iterative optimization procedure. The goal is to provide assistive feedback to some creation/editing process. Examples include constraint‐based GUI layout and complex snapping scenarios. Many geometric problems, such as fitting a shape to data, involve optimizations which may take seconds to complete (or even longer), yet require human guidance. In order to make these optimization routines practical in interactive sessions, simplifications or sacrifices must be made. Canonically, non‐convex optimization problems are solved iteratively by taking a series of steps towards a solution. By their nature, there are many locally optimal solutions; which solution is found is highly dependent on an initial guess. There is a fundamental conflict between optimization and interactivity. Interrupting and restarting the optimization every time the user, e.g. moves the mouse prevents any solution from being computed until the user ceases interaction. Continuing to run the optimization procedure computes a perpetually outdated solution. This presents a particular unsolved challenge with respect to direct manipulation. Every time the user, e.g. moves the mouse, the entire optimization must be re‐started with the new user input, since returning a stale result associated with the previous user state is undesirable. We propose predictive short‐circuiting to reduce this fundamental tension. Our approach memoizes paths in the optimization's configuration space and predicts the trajectory of future optimization in real time, leveraging common C1$C^1$ continuity assumptions. This enables direct manipulation of formerly sluggish interactions. We demonstrate our approach on geometric fitting tasks. Additionally, we evaluate complementary mouse motion prediction algorithms as a means to discard or skip optimization problems that are irrelevant to the user's intended initial configuration for a targeted optimization procedure. Predicting where the mouse cursor will be located at the end of an operation, such as dragging a model of an engine component into scanned point cloud data to perform geometric alignment, allows us to pre‐emptively begin solving the targeted problem before the user finishes their movement. We take advantage of the fact that the prediction indicates the approximate energy basin the optimization procedure will need to explore. [ABSTRACT FROM AUTHOR] |
| Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In many interactive systems, user input initializes and launches an iterative optimization procedure. The goal is to provide assistive feedback to some creation/editing process. Examples include constraint‐based GUI layout and complex snapping scenarios. Many geometric problems, such as fitting a shape to data, involve optimizations which may take seconds to complete (or even longer), yet require human guidance. In order to make these optimization routines practical in interactive sessions, simplifications or sacrifices must be made. Canonically, non‐convex optimization problems are solved iteratively by taking a series of steps towards a solution. By their nature, there are many locally optimal solutions; which solution is found is highly dependent on an initial guess. There is a fundamental conflict between optimization and interactivity. Interrupting and restarting the optimization every time the user, e.g. moves the mouse prevents any solution from being computed until the user ceases interaction. Continuing to run the optimization procedure computes a perpetually outdated solution. This presents a particular unsolved challenge with respect to direct manipulation. Every time the user, e.g. moves the mouse, the entire optimization must be re‐started with the new user input, since returning a stale result associated with the previous user state is undesirable. We propose predictive short‐circuiting to reduce this fundamental tension. Our approach memoizes paths in the optimization's configuration space and predicts the trajectory of future optimization in real time, leveraging common C1$C^1$ continuity assumptions. This enables direct manipulation of formerly sluggish interactions. We demonstrate our approach on geometric fitting tasks. Additionally, we evaluate complementary mouse motion prediction algorithms as a means to discard or skip optimization problems that are irrelevant to the user's intended initial configuration for a targeted optimization procedure. Predicting where the mouse cursor will be located at the end of an operation, such as dragging a model of an engine component into scanned point cloud data to perform geometric alignment, allows us to pre‐emptively begin solving the targeted problem before the user finishes their movement. We take advantage of the fact that the prediction indicates the approximate energy basin the optimization procedure will need to explore. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 01677055 |
| DOI: | 10.1111/cgf.70091 |
