Solves the alignment problem: find 'a' that minimizes weighted L1 distance. If trunc is provided, it solves a Robust L1 problem using an exhaustive search over critical points (extrema) in the derivative of the piecewise linear loss.
(
x: torch.Tensor,
y: torch.Tensor,
w: torch.Tensor,
trunc: Optional[Union[float, torch.Tensor]] = None,
eps: float = 1e-7
)
source not stored for this graph (policy: none)
no test coverage detected