Skip to content

Instantly share code, notes, and snippets.

View youqad's full-sized avatar
🇬🇧
Research internship at Cambridge University

Younesse Kaddar youqad

🇬🇧
Research internship at Cambridge University
View GitHub Profile
@youqad
youqad / o1-preview-01928a22-ff39-7540-87f3-a3ff1817c756.json
Last active October 15, 2024 08:28
Chat trace of solutions by o1-preview: pass all tests, but use helper functions (cf. https://github.com/youqad/bit-reversal-trees)
{
"id": "01928a22-ff39-7540-87f3-a3ff1817c756",
"project_id": "ox/bit-reversal-trees",
"op_name": "weave:///ox/bit-reversal-trees/op/chat_completion_request:Qk5KvLtkFOElrMcJeSjrbLNK80b4VOx6o5YsYwdFRf8",
"display_name": null,
"trace_id": "01928a22-ff39-7540-87f3-a40a5e338663",
"parent_id": null,
"started_at": "2024-10-14T08:26:42.361000Z",
"attributes": {
"weave": {
@youqad
youqad / grant_budget_estimator.py
Created February 10, 2025 10:26
Little CLI to estimate the compute budget for an LLM research project.
"""
Grant Budget & GPU Resource Estimator
A script for estimating compute requirements and costs for LLM training:
1. Compute budget estimation (FLOP-based calculations):
- GPU-hours and costs for fine-tuning runs
- Hyperparameter search
- Ablations
@youqad
youqad / o3-0196425c-0650-7df2-8d57-05d272f6d111.json
Last active April 17, 2025 08:24
Taelin Challenge (cf. https://github.com/youqad/bit-reversal-trees): chat trace of Python solutions by o3: passes all tests, and does NOT use helper functions, so it solves the challenge!
{
"id": "0196425c-0650-7df2-8d57-05d272f6d111",
"project_id": "ox/bit-reversal-trees",
"op_name": "weave:///ox/bit-reversal-trees/op/chat_completion_request:fLxiU06Rw0YFqT9SibsBml07ruJXJ5o9DCYlnVUIP5I",
"display_name": null,
"trace_id": "0196425c-0650-7df2-8d57-05c86c2919b6",
"parent_id": null,
"started_at": null,
"attributes": {
"weave": {
@youqad
youqad / o3-019642d6-1889-7792-ada8-81be8701d7da.json
Last active April 17, 2025 08:30
Taelin Challenge (cf. https://github.com/youqad/bit-reversal-trees): chat trace of Haskell solutions by o3: passes all tests, and does NOT use unauthorized helper functions, so it solves the challenge!
{
"id": "019642d6-1889-7792-ada8-81be8701d7da",
"project_id": "ox/bit-reversal-trees",
"op_name": "weave:///ox/bit-reversal-trees/op/chat_completion_request:fLxiU06Rw0YFqT9SibsBml07ruJXJ5o9DCYlnVUIP5I",
"display_name": null,
"trace_id": "019642d6-1889-7792-ada8-81af6ec057bc",
"parent_id": null,
"started_at": null,
"attributes": {
"weave": {