facebookresearch / facebookresearch/theseus
Optimize quasi-static pushing cost function's Jacobians
Open
good first issue
performance
- Dominant language
- Python
- Stars
- 2.1k
- Forks
- 149
- PR merge metrics
- No merged PRs in 30d
Description
Current implementation uses a few intermediate matrix multiplication that can be removed and the final results just hardcoded using indexing or basic torch operations.
Contributor guide
Research direction
No files or tests are named. Locate the quasi-static pushing cost function and its Jacobian implementation, then inspect the intermediate matrix multiplications and existing torch operations before measuring or validating equivalent Jacobian results. Done means the redundant multiplications are removed and the final results remain unchanged.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python, pytorch
- Domain
- performance, robotics
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100