Upload metrics.jsonl with huggingface_hub

metrics.jsonl

@@ -441,3 +441,80 @@
 {"timestamp": 1787810497.8390346, "elapsed_hours": 0.5011880829599169, "event": "step", "step": 7780, "loss": 4.39210391998291, "lr": 1.7906775927498368e-05}
 {"timestamp": 1787810501.8639317, "elapsed_hours": 0.5023061099317339, "event": "step", "step": 7800, "loss": 4.340878047943115, "lr": 1.785446457707847e-05}
 {"timestamp": 1787810507.5084774, "elapsed_hours": 0.5038740393850538, "event": "sample", "step": 7800, "prompt": "Write a Python function to check if a string is a palindrome.", "sample": "Here is a Python function that checks if a string can be palindrome:\n\n```python\ndef check_palindromes(string):\n    # Check if the string is a palindrome and return True\n    pass\n\n    def sort(s):\n        # Sort the string in reverse order (in case of a palindrome)\n        sorted_string = sorted(s, ''.join((',')))\n\n    # Check if the string can contain any palindrome\n    for i in range(len(s)):  \n\n    # If all characters are alphanumeric, return True\n    if sorted_string[my_string] == 'aeiou':\n\n ", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810512.08306, "elapsed_hours": 0.5051447567674848, "event": "step", "step": 7820, "loss": 4.3558747100830075, "lr": 1.7802132674468657e-05}
+{"timestamp": 1787810516.0545619, "elapsed_hours": 0.506247951719496, "event": "step", "step": 7840, "loss": 4.386956071853637, "lr": 1.7749781013735627e-05}
+{"timestamp": 1787810519.9176524, "elapsed_hours": 0.5073210324181451, "event": "step", "step": 7860, "loss": 4.3955335569381715, "lr": 1.769741038924586e-05}
+{"timestamp": 1787810523.946581, "elapsed_hours": 0.5084401793612374, "event": "step", "step": 7880, "loss": 4.36553726196289, "lr": 1.7645021595653608e-05}
+{"timestamp": 1787810527.4529443, "elapsed_hours": 0.5094141691260867, "event": "step", "step": 7900, "loss": 4.3802166843414305, "lr": 1.7592615427888796e-05}
+{"timestamp": 1787810531.664573, "elapsed_hours": 0.5105840659803814, "event": "step", "step": 7920, "loss": 4.347770438194275, "lr": 1.754019268114499e-05}
+{"timestamp": 1787810535.3862836, "elapsed_hours": 0.5116178743044535, "event": "step", "step": 7940, "loss": 4.383725171089172, "lr": 1.7487754150867318e-05}
+{"timestamp": 1787810539.0550392, "elapsed_hours": 0.5126369731293784, "event": "sample", "step": 7950, "prompt": "Explain the difference between a stack and a queue.", "sample": "A stack and a queue are two different types of data structures that can be used to store data. A queue is a type in which the list is an array or dictionary, and also a set is a key-value pair that maps each element to its own value. In other words, a queue can be used as an array or dictionary in the same way it is called for.<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810540.9439514, "elapsed_hours": 0.5131616710291969, "event": "step", "step": 7960, "loss": 4.376720213890076, "lr": 1.7435300632740394e-05}
+{"timestamp": 1787810544.7382917, "elapsed_hours": 0.5142156544658872, "event": "step", "step": 7980, "loss": 4.3538923263549805, "lr": 1.7382832922676262e-05}
+{"timestamp": 1787810548.674032, "elapsed_hours": 0.5153089155753453, "event": "step", "step": 8000, "loss": 4.409790005683899, "lr": 1.7330351816802313e-05}
+{"timestamp": 1787810552.5420964, "elapsed_hours": 0.5163833780421151, "event": "step", "step": 8020, "loss": 4.3808169221878055, "lr": 1.7277858111449185e-05}
+{"timestamp": 1787810556.5181975, "elapsed_hours": 0.5174878505865733, "event": "step", "step": 8040, "loss": 4.347242565155029, "lr": 1.7225352603138716e-05}
+{"timestamp": 1787810560.8379724, "elapsed_hours": 0.5186877879169253, "event": "step", "step": 8060, "loss": 4.346917648315429, "lr": 1.717283608857182e-05}
+{"timestamp": 1787810564.8524396, "elapsed_hours": 0.5198029177718693, "event": "step", "step": 8080, "loss": 4.319977684020996, "lr": 1.712030936461643e-05}
+{"timestamp": 1787810568.632181, "elapsed_hours": 0.5208528459734387, "event": "step", "step": 8100, "loss": 4.369044132232666, "lr": 1.706777322829539e-05}
+{"timestamp": 1787810570.0257332, "elapsed_hours": 0.5212399437030156, "event": "sample", "step": 8100, "prompt": "Write a Python function to find the maximum element in a list.", "sample": "def find_max(lst):\n   max_value = None\n\n  for element in lst:\n   if not isinstance(*element, len(lst)):\n    max_value = max([index for index in element])\n\n  return max_value<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810573.8917563, "elapsed_hours": 0.5223138390647041, "event": "step", "step": 8120, "loss": 4.389482126235962, "lr": 1.701522847677435e-05}
+{"timestamp": 1787810577.9735215, "elapsed_hours": 0.5234476627243889, "event": "step", "step": 8140, "loss": 4.405717058181763, "lr": 1.6962675907349707e-05}
+{"timestamp": 1787810581.80895, "elapsed_hours": 0.5245130595233706, "event": "step", "step": 8160, "loss": 4.422799935340882, "lr": 1.691011631743647e-05}
+{"timestamp": 1787810585.7200909, "elapsed_hours": 0.5255994875563516, "event": "step", "step": 8180, "loss": 4.3767061614990235, "lr": 1.6857550504556177e-05}
+{"timestamp": 1787810589.4174879, "elapsed_hours": 0.5266265422768063, "event": "step", "step": 8200, "loss": 4.376985635757446, "lr": 1.6804979266324792e-05}
+{"timestamp": 1787810593.2291238, "elapsed_hours": 0.5276853300465478, "event": "step", "step": 8220, "loss": 4.350179495811463, "lr": 1.6752403400440603e-05}
+{"timestamp": 1787810596.8877275, "elapsed_hours": 0.5287016089757284, "event": "step", "step": 8240, "loss": 4.373438339233399, "lr": 1.6699823704672115e-05}
+{"timestamp": 1787810600.9131403, "elapsed_hours": 0.5298197790649202, "event": "sample", "step": 8250, "prompt": "Write a Python function that returns the nth Fibonacci number.", "sample": "Here is a Python function that returns the nth Fibonacci number:\n```python\ndef fib(n): \n   if n < 2: return 0\n\n   for i in range(2, int(math.sqrt(n)) + 1):\n     if n == 2: return 0\n\n   return fib(i)\n```<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810609.7455177, "elapsed_hours": 0.5322732173071967, "event": "step", "step": 8260, "loss": 4.369097743034363, "lr": 1.664724097684594e-05}
+{"timestamp": 1787810613.9702125, "elapsed_hours": 0.5334467436207665, "event": "step", "step": 8280, "loss": 4.40817551612854, "lr": 1.6594656014834703e-05}
+{"timestamp": 1787810617.8697472, "elapsed_hours": 0.5345299476385117, "event": "step", "step": 8300, "loss": 4.404576301574707, "lr": 1.6542069616544942e-05}
+{"timestamp": 1787810621.6433296, "elapsed_hours": 0.5355781649880939, "event": "step", "step": 8320, "loss": 4.369515962600708, "lr": 1.648948257990497e-05}
+{"timestamp": 1787810625.5209517, "elapsed_hours": 0.536655282245742, "event": "step", "step": 8340, "loss": 4.345903830528259, "lr": 1.6436895702852793e-05}
+{"timestamp": 1787810629.5816863, "elapsed_hours": 0.5377832641204198, "event": "step", "step": 8360, "loss": 4.358914804458618, "lr": 1.6384309783323994e-05}
+{"timestamp": 1787810633.3906074, "elapsed_hours": 0.5388412976927227, "event": "step", "step": 8380, "loss": 4.4175060892105105, "lr": 1.633172561923963e-05}
+{"timestamp": 1787810637.2194273, "elapsed_hours": 0.5399048588011, "event": "step", "step": 8400, "loss": 4.42834463596344, "lr": 1.627914400849412e-05}
+{"timestamp": 1787810637.8094702, "elapsed_hours": 0.5400687596533034, "event": "sample", "step": 8400, "prompt": "What is the time complexity of binary search and why?", "sample": "99%  time complexity of binary search is O(n^2) where n is the number of elements in a set.<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810641.759853, "elapsed_hours": 0.5411660881837209, "event": "step", "step": 8420, "loss": 4.385242595672607, "lr": 1.622656574894314e-05}
+{"timestamp": 1787810645.5434985, "elapsed_hours": 0.542217100792461, "event": "step", "step": 8440, "loss": 4.3665182447433475, "lr": 1.617399163839151e-05}
+{"timestamp": 1787810649.510761, "elapsed_hours": 0.5433191182878282, "event": "step", "step": 8460, "loss": 4.357847170829773, "lr": 1.6121422474581106e-05}
+{"timestamp": 1787810653.4871683, "elapsed_hours": 0.5444236757357915, "event": "step", "step": 8480, "loss": 4.382809805870056, "lr": 1.6068859055178737e-05}
+{"timestamp": 1787810657.6979394, "elapsed_hours": 0.5455933343701892, "event": "step", "step": 8500, "loss": 4.395999069213867, "lr": 1.601630217776405e-05}
+{"timestamp": 1787810661.5792418, "elapsed_hours": 0.5466714738474951, "event": "step", "step": 8520, "loss": 4.407766346931457, "lr": 1.596375263981742e-05}
+{"timestamp": 1787810665.4907718, "elapsed_hours": 0.5477580099635654, "event": "step", "step": 8540, "loss": 4.370261516571045, "lr": 1.5911211238707865e-05}
+{"timestamp": 1787810669.3355021, "elapsed_hours": 0.5488259908225801, "event": "sample", "step": 8550, "prompt": "Write a Python function to check if a string is a palindrome.", "sample": "Here is a Python function that checks if a string is palindrome:\n```python\ndef is_palindrome(string):\n    # Remove non-alphanumeric characters and convert to lowercase\n    string = number.lower()\n\n    return list(string) == [number for number in str(int(digit)) if digit != '0']\n```<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810671.4313533, "elapsed_hours": 0.5494081715080473, "event": "step", "step": 8560, "loss": 4.360662813186646, "lr": 1.5858678771680928e-05}
+{"timestamp": 1787810675.2124963, "elapsed_hours": 0.5504584891928567, "event": "step", "step": 8580, "loss": 4.365638508796692, "lr": 1.58061560358466e-05}
+{"timestamp": 1787810679.0617683, "elapsed_hours": 0.5515277312861548, "event": "step", "step": 8600, "loss": 4.326673817634583, "lr": 1.57536438281672e-05}
+{"timestamp": 1787810683.0651662, "elapsed_hours": 0.5526397861374749, "event": "step", "step": 8620, "loss": 4.359853911399841, "lr": 1.5701142945445317e-05}
+{"timestamp": 1787810686.8282948, "elapsed_hours": 0.5536850997474458, "event": "step", "step": 8640, "loss": 4.3826901149749755, "lr": 1.5648654184311678e-05}
+{"timestamp": 1787810690.8118927, "elapsed_hours": 0.5547916548119651, "event": "step", "step": 8660, "loss": 4.338463978767395, "lr": 1.559617834121309e-05}
+{"timestamp": 1787810694.6798224, "elapsed_hours": 0.5558660795953538, "event": "step", "step": 8680, "loss": 4.3572753190994264, "lr": 1.5543716212400344e-05}
+{"timestamp": 1787810698.391664, "elapsed_hours": 0.5568971469004949, "event": "step", "step": 8700, "loss": 4.42338080406189, "lr": 1.5491268593916142e-05}
+{"timestamp": 1787810700.8795164, "elapsed_hours": 0.5575882168610891, "event": "sample", "step": 8700, "prompt": "Explain the difference between a stack and a queue.", "sample": "A stack and a queue are two different types of nodes. Each node has its own set of data and the value at that point in memory is the->queue[0]. The number of items to be added in order for the stack to members as a class of nodes can both be considered multiple layers or iterators.\n\nIn the case where we have two containers (a container and an object), a stack is crucial because our data can be copied to another node. When we eat items, they are added in the list rather than iterating over them.<", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810704.753217, "elapsed_hours": 0.5586642448769675, "event": "step", "step": 8720, "loss": 4.405352091789245, "lr": 1.5438836281583002e-05}
+{"timestamp": 1787810708.6018183, "elapsed_hours": 0.5597333008050919, "event": "step", "step": 8740, "loss": 4.383397884368897, "lr": 1.5386420070991194e-05}
+{"timestamp": 1787810712.6409497, "elapsed_hours": 0.5608552816841338, "event": "step", "step": 8760, "loss": 4.336622610092163, "lr": 1.533402075748667e-05}
+{"timestamp": 1787810716.7813153, "elapsed_hours": 0.562005383239852, "event": "step", "step": 8780, "loss": 4.350932488441467, "lr": 1.5281639136158994e-05}
+{"timestamp": 1787810720.7826393, "elapsed_hours": 0.5631168622440762, "event": "step", "step": 8800, "loss": 4.384348773956299, "lr": 1.5229276001829257e-05}
+{"timestamp": 1787810724.7602298, "elapsed_hours": 0.5642217484447691, "event": "step", "step": 8820, "loss": 4.387609748840332, "lr": 1.5176932149038052e-05}
+{"timestamp": 1787810728.9606345, "elapsed_hours": 0.5653885273800956, "event": "step", "step": 8840, "loss": 4.447053031921387, "lr": 1.5124608372033397e-05}
+{"timestamp": 1787810735.351182, "elapsed_hours": 0.567163679599762, "event": "sample", "step": 8850, "prompt": "Write a Python function to find the maximum element in a list.", "sample": "You can use the following python function to find the maximum element in a list:\n\n```python\ndef max_element(lst):\n    # Convert input list to an array of elements\n    arr = [x for x in lst if isinstance(x, int) and i == 0]\n\n    # Initialize the maximum element\n    max_max = 1\n\n    for i in arr:\n        # Get the current element's maximum element\n        max_max += i\n\n    return max_max\n```\n\nYou can call this function with your list of lists as an argument, like so:\n\n```python\nmy_list = [1, 2, 3]", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810737.3778954, "elapsed_hours": 0.5677266554700003, "event": "step", "step": 8860, "loss": 4.409070315361023, "lr": 1.5072305464758682e-05}
+{"timestamp": 1787810741.0774982, "elapsed_hours": 0.5687543228599761, "event": "step", "step": 8880, "loss": 4.360380477905274, "lr": 1.5020024220840631e-05}
+{"timestamp": 1787810744.9381785, "elapsed_hours": 0.569826734132237, "event": "step", "step": 8900, "loss": 4.399992117881775, "lr": 1.4967765433577253e-05}
+{"timestamp": 1787810748.6974163, "elapsed_hours": 0.5708709669113159, "event": "step", "step": 8920, "loss": 4.3794460248947145, "lr": 1.491552989592581e-05}
+{"timestamp": 1787810752.6924639, "elapsed_hours": 0.5719807022147708, "event": "step", "step": 8940, "loss": 4.3564633893966676, "lr": 1.4863318400490784e-05}
+{"timestamp": 1787810756.7036083, "elapsed_hours": 0.5730949090586768, "event": "step", "step": 8960, "loss": 4.356124801635742, "lr": 1.4811131739511838e-05}
+{"timestamp": 1787810760.4580703, "elapsed_hours": 0.5741378150383631, "event": "step", "step": 8980, "loss": 4.381265268325806, "lr": 1.4758970704851815e-05}
+{"timestamp": 1787810764.3114214, "elapsed_hours": 0.5752081905470954, "event": "step", "step": 9000, "loss": 4.342662572860718, "lr": 1.470683608798471e-05}
+{"timestamp": 1787810766.07587, "elapsed_hours": 0.5756983151038487, "event": "sample", "step": 9000, "prompt": "Write a Python function that returns the nth Fibonacci number.", "sample": "def nth_fibonacci(n): \n if n == 0: return 1\n else: \n fib = 2\n\n # Find the first Fibonacci number.\n for _ in range(2, n): \n  if fib[r][n-1] == fib[r+1][n]: \n fib.append(fib)<|im_end|>", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810776.050472, "elapsed_hours": 0.5784690378771888, "event": "step", "step": 9020, "loss": 4.387172594070434, "lr": 1.4654728679983666e-05}
+{"timestamp": 1787810780.1632297, "elapsed_hours": 0.5796114705668556, "event": "step", "step": 9040, "loss": 4.396984491348267, "lr": 1.4602649271508963e-05}
+{"timestamp": 1787810783.8731685, "elapsed_hours": 0.58064200911257, "event": "step", "step": 9060, "loss": 4.357194347381592, "lr": 1.455059865279603e-05}
+{"timestamp": 1787810788.1137514, "elapsed_hours": 0.5818199489514033, "event": "step", "step": 9080, "loss": 4.414842853546142, "lr": 1.4498577613643445e-05}
+{"timestamp": 1787810791.8628483, "elapsed_hours": 0.5828613646162881, "event": "step", "step": 9100, "loss": 4.418566970825196, "lr": 1.4446586943400958e-05}
+{"timestamp": 1787810795.5221043, "elapsed_hours": 0.583877824611134, "event": "step", "step": 9120, "loss": 4.437863359451294, "lr": 1.4394627430957516e-05}
+{"timestamp": 1787810799.3738203, "elapsed_hours": 0.5849477458000183, "event": "step", "step": 9140, "loss": 4.365578575134277, "lr": 1.4342699864729281e-05}
+{"timestamp": 1787810805.6941981, "elapsed_hours": 0.586703406241205, "event": "sample", "step": 9150, "prompt": "What is the time complexity of binary search and why?", "sample": "If you are programming for binary search and want to find a time complexity, then your code should look something like this:\n```python\ndef bk_match(start=0, end=-1):  # If the start and end points of the range are 0 (not present)\n  a = -1\n  b = 1\n\n  while(start < b):\n    if start >= 0 and end <= n:  # If the end points are 1, then there is an element in search range \n      q = start + (end - start) // 2\n    elif end >= 0 and start <= n: # If the end points are 0, then there is an element in sear", "has_open": false, "has_close": false, "has_end": true, "reasoning_len": 0, "is_real_reasoning": false}
+{"timestamp": 1787810807.534238, "elapsed_hours": 0.5872145285871294, "event": "step", "step": 9160, "loss": 4.357766280174255, "lr": 1.4290805032647678e-05}