_index.org

Example: Cloth Fitting Prediction

Last edited: August 8, 2025

Have: \(m\) training data points \((\theta_{i}, \phi_{i})\) generated from the true/approximated function \(\phi_{i} = f\qty (\theta_{i})\) (which uses physical simulation/CV techniques). Training data here is *very expensive and lots of errors

Want: \(\hat{f}\qty(\theta) = f\qty(\theta)\)

Problem: as joints rotate (which is highly nonlinear), cloth verticies move in complex and non-linear ways which are difficult to handle with a standard neural network—there are highly non-linear rotations! which is not really easy to make with standard model functions using \(\hat{f}\).

Exercises in PGA

Last edited: August 8, 2025

Preamble

As notation differs between Alg4DM (which the presentation and notes use) and the paper, we provide a note here to standardize the notation of the PGA formulation to avoid confusion.

Recall that the non-linear program formulation of the naive PGA implementation gives:

\begin{align} \max_{\theta}\ &f(\theta) \\ \text{such that}\ &J\theta = \bold{1} \\ & \theta \geq \bold{0} \\ & h_{i}(\theta) \leq \epsilon_{i},\ \forall i \end{align}

for:

\begin{equation} f(\theta) = \beta^{\top} \bold{Z}^{-1} \bold{r}_{\theta} \end{equation}

existence of eigenvalue of operators

Last edited: August 8, 2025

A result so important it gets a page.

Every operator on a finite-dimensional, non-zero, complex vector space has an eigenvalue.

Proof:

Suppose \(V\) is a complex vector space with dimension \(n > 0\), and \(T \in \mathcal{L}(V)\). Choose \(v \in V, v\neq 0\) (possible as \(V\) is non-zero):

Construct a list of \(n+1\) vectors:

\begin{equation} v, Tv, \dots T^{n} v \end{equation}

because we managed to cram \(n+1\) vectors into a list for a vector space with dimension \(n\), that list is linearly dependent.

expectation

Last edited: August 8, 2025

expectation is the calculation of the “intended” or “target” value given a random variable:

\begin{equation} \mathbb{E}[M] = \sum_{x} x\ p(X=x) \end{equation}

  1. Standardize variables to \(z\) by dividing
  2. The correlation is simply their “product”: means of positive and negative groups

The expectation is the average of the counts of the data you have.

properties of expectation

these holds REGARDLESS of whether or not the variables you are doing is independent, IID, etc.

Linearity in the first slot

expectation has additivity and homogeneity.

explainability

Last edited: August 8, 2025

Explainability is the study of, when stuff breaks, understanding why it does.

Here are a set of explainability techniques!

policy visualization

Roll your system out and look at it

Some common strategies that people use to do this:

  • plot the policy: look at what the agent says to do at each state (if you have too many dimensions, just plot slices!)
  • slicing: one way to deal with history-dependent trajectories is to then just count the number of actions that your system takes at each step, and plot the argmax of it

feature importance

Our goal is still to understand the contribution of various features to the overall behavior of a system.