lqr

6 ms·

1.
by lqr 2mo ago
As an academic who is forced to review AI-generated conference/journal submissions, I can assure you this is not the case. LLM-heavy papers are terrible. Even if they manage to avoid straight-up factual incorrectness, the writing is fu
2.
Unitree G1 humanoid robot security vulnerabilities and non-consensual telemetry(arxiv.org)
2 points by lqr 10mo ago|0 comments
3.
by lqr 1y ago
The mathematical field of Differential Geometry can answer this question precisely: https://en.wikipedia.org/wiki/Geodesic#Affine_geodesics An oblate spheroid is an example of a Riemannian manifold: a smooth object tha
4.
by lqr 1y ago
In this example, random numbers provoked the worst case too often. However, in other situations random numbers are "too nice". For example, a random matrix with independent identically-distributed zero-mean entries is overwhelming
5.
by lqr 1y ago
For math and writing, we still have in-class exams as an LLM-free evaluation tool. I wish there was some way to do the same for programming. Imagine a classroom full of machines with no internet connection, just a compiler and some offline
6.
by lqr 1y ago
This paper may be interesting to you. It touches on several of the topics you mentioned: https://www.science.org/doi/10.1126/scirobotics.abm6597
7.
by lqr 2y ago
10 years ago it was already folklore that compilers ignore the "inline" keyword when optimizing, but that was false for clang/llvm: https://stackoverflow.com/questions/27042935/are-the-inline-...
8.
by lqr 3y ago
It is not even close. Almost every branch of modern mathematics includes an important contribution from Euler in its history. Erdos was a specialist by comparison. If you sample a random person with a math degree, the probability that they
9.
by lqr 3y ago
I applied to tenure-track positions the current cycle. A lot of places were hiring non-TT lecturers too, and a few were hiring only non-TT. The application-submitting phase of the current cycle is over for TT positions, and some of the li
10.
by lqr 3y ago
Here is a recent and interesting paper connecting GJK and convex optimization [1]. They show that GJK is equivalent to the iterations of the Frank-Wolfe algorithm applied to the QP, and that recent improvements to Frank-Wolfe can be applied
11.
by lqr 3y ago
For simple applications there's no need to learn about quaternions at all. There could be a library type called Rotation3D or something. You should never need to know which representation it uses. The important part is to know Euler an
12.
by lqr 3y ago
If the author is here: I would really enjoy leaderboards!
13.
by lqr 3y ago
Midshipman hitch is great, I used it to reinforce my tomato cages with some tension members.
14.
by lqr 3y ago
Good luck. Still calm here in northeast LA too.
15.
by lqr 3y ago
My siblings and I replaced my parents' rickety exterior stairs. It was super gratifying to make their house safer and save them thousands of dollars while having fun.
16.
by lqr 3y ago
But why isn't the proposed method an instance of smart guessing? It reduces oracle complexity with heuristics. The heuristic is "build a machine learning model of the objective function and use it to fake oracle queries most of th
17.
by lqr 3y ago
How can your prior be uniform if the hypothesis class is unbounded?
18.
by lqr 3y ago
Agreed!
19.
by lqr 3y ago
(assuming math-ish problems) Try to solve a simpler version of the problem. Keep making simplifying assumptions until you get something you can handle. Often you realize that some parts of the original problem statement were adding complexi
20.
by lqr 3y ago
Of course, but ROS makes it easier to slip into this flawed process. I prefer tools that help you avoid bad engineering processes.
21.
by lqr 3y ago
I worked on a robotics project with a large team using ROS1. The loose coupling is pernicious: It's easy for everyone to work on their own ROS node in isolation and avoid testing the integrated system. There's no compiler to help
22.
by lqr 3y ago
The field of "algorithms with predictions" studies how to use predictions/learning within traditional CS problem settings: > We introduce algorithms that use predictions from machine learning applied to the input to circu
23.
by lqr 3y ago
I think the real strength of this method is that it doesn't require the data live in a vector space. Once you give up that structure, you're pretty much locked in to using points from the dataset as the cluster representatives, un
24.
by lqr 4y ago
I have to disagree with some of your points. > The main difficulty is high dimensionality. We simply do not have mathematical frameworks to analyze structures in the 100s of dimensions. The main difficulty in deep learning is the non-c
25.
by lqr 4y ago
It is a tough battle between SVD and the concept of eigenvalues/vectors. SVD is only meaningful for linear operators between inner product spaces, whereas eigenvalues/vectors do not even require a norm. On the other hand, eigenvec
26.
by lqr 4y ago
There is finally a time to share my technical report, "Ensuring a Safe Perpetual Stew": http://jpreiss.github.io/fun/perpetual.pdf TL;DR: Under reasonable assumptions, one should choose a stew volume such tha
27.
by lqr 4y ago
During my PhD, the lab invested a lot of software development effort into a closed-source robotics platform that was discontinued [1]. I will try hard to avoid closed platforms in the future. As academics, I feel we should put in our best e
28.
by lqr 4y ago
A good example for pundit disproving is f(t) = exp(-t), the solution to the differential equation dx/dt = -x. So the continuous limit of something like "every year, 1% of the ice caps melt." Look, the volume of ice cap lost i
29.
by lqr 4y ago
To elaborate: Since a quadrotor can only generate thrust in one direction, any smooth trajectory through space specifies a unique pitch/roll attitude at each moment in time. The attitude at time t is determined by the trajectory's
30.
by lqr 4y ago
Simulated annealing is still prone to getting stuck in local minima if the steps during the high-temperature phase are unlucky. It's always worth trying a multi-start approach, i.e. run the same algorithm more than once (in parallel if

More ›