MLcomp - Viewing Run 14719

Server

Run 14719

Creator	internal
Program	sequor-plain
Dataset	jdpa-bnp-pos BIO
Task type	SequenceTagging
Created	28d17h ago

Status: Failed!

Note: this page autoupdates while a run is in progress

Reason	(see end of log file)
Total Time	1m21s
Max Memory Usage	510M
Domain	SequenceTagging
Learn time	1m24s
Train acc.
Train F1
Predict train time
Test acc.
Test F1
Predict test time

Log file

===== MAIN: learn based on training data =====
=== START program1: ./run learn ../dataset2/train
Param vector bounds: (I 0 3,I 2 88642)
sequor: mkTextEncoding: invalid argument (Invalid argument)
./run:18: Failed (RuntimeError)
=== END program1: ./run learn ../dataset2/train --- FAILED [84s]

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.