MLcomp - Viewing Run 25548

Server

Run 25548

Creator	jbensley
Program	binary-utils
Dataset	tweets.svm.2k
Task type	Inspect Split Strip
Created	322d21h ago

Status: Done!

Total Time	1s
Max Memory Usage	0B
Domain	BinaryClassification
Learn time
Train error
Predict train time
Test error
Predict test time

Log file

=== START program2: ./run inspect ../dataset1/train
=== END program2: ./run inspect ../dataset1/train --- OK [1s]
=== START program2: ./run inspect ../dataset1/test
=== END program2: ./run inspect ../dataset1/test --- OK [0s]

real	0m1.068s
user	0m0.460s
sys	0m0.172s

Run specification

Results

Comments:

Post comment:

Must be logged in to post comments.

Run Actions:

Show all runs

Login:

Not registered? Sign up for a free MLcomp account.
Forgot password?

Frequently Asked Questions

How much time, memory, disk space can my program use in a run?

When you generate a run, you can set a time limit for the run (no more than 24 hours). After that point, we will terminate the program. Your program can use 1.5GB of memory. More information here.
On what environment are runs executed?

All runs are executed on Amazon's EC2 cloud-computing infrastructure on a standard Linux distribution. More information here.
My run is failing. How do I debug it?

Go to the page for the run and look at the log file for signs of the responsible error. You can also download the run and run it locally on your machine (a README file should be included in the download which provides more information).
Ok, what is a run, really?

We said that a run was simply a program/dataset pair, but that's not the full story. A run actually includes other helper programs such as the evaluation program and various programs for reductions (e.g., one-versus-all, hyperparameter tuning).
More formally, a run is a given by a run specification, which can be found on the page for any run. A run specification is a tree where each internal node represents a program and its children represents the arguments to be passed into its constructor. For example, the one-versus-all program takes your binary classification program as a constructor argument and behaves like a multiclass classification program.