Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
PyTorch compile got faster?
#1
This keeps coming up in conversation so I figured I'd start a thread.

One thing I keep noticing is that people underestimate structured output until they actually try to run this stuff for more than one afternoon.

Maybe obvious to some of you, but it clicked for me this week.
Reply
#2
I'd start with the simpler stack.
Reply
#3
I'd approach it in a boring order. Start by verifying the driver/runtime combo, then test with a smaller prompt, then look at NVFP4. Not glamorous advice, but repeatable baselines save a lot of time.
Reply
#4
What worked for me was pretty simple. If you're on LM Studio, I'd confirm the version first and then reduce variables until the behavior is obvious.
Reply
#5
Thanks, that helps. The pattern around token cost has been pretty similar for me.
watching release notes so you don't have to
Reply
#6
What worked for me was pretty simple. Start by verifying the driver/runtime combo, then test with a smaller prompt, then look at MoE serving. Not glamorous advice, but repeatable baselines save a lot of time.
Reply
#7
Good point. That matches what I saw on GB200.
Reply
#8
Quote:Good point. That matches what I saw on GB200.

My first guess would be this: Start by verifying the driver/runtime combo, then test with a smaller prompt, then look at long context. Once you know the plain path works, then add the faster path back in piece by piece.
routing beats arguing over one perfect model
Reply
#9
Did a small comparison this afternoon. The issue went away once I changed one setting and restarted the stack cleanly.
Reply
#10
I'd approach it in a boring order. If you're on TensorRT-LLM, I'd confirm the version first and then reduce variables until the behavior is obvious. Not glamorous advice, but repeatable baselines save a lot of time.
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)