\begin{equation} B = \qty[(x_1, y_1), \dots, (x_{n}, y_{n})] \end{equation}

where the labels would be:

\begin{equation} C(b) = \begin{cases} 0, if \sum_{i}^{}y_{i} = 0 \\ 1, \text{otherwise} \end{cases} \end{equation}

and then we maxpool

MILFormer

MILFormer is a multiple-instance learning scheme which makes predictions over input patches whose output predictions are weighted as multi-distirbution.

The multiplicative identity allows another number to retain its identity after multiplying. Its \(1\) [for fields?].

TBD

multiprocessing is the act of switching between multiple processes so fast that it appears multiple processes are running concurrently.

• OS schedules tasks
• each program gets a little time, then has to wait in a turn to continue executing

base level syscalls that requires waiting will be moved off before finishing, and in the meantime others can wait. like file read.

program

A program is a script to be ran.

process

a process is an instance of a program. Every process has a unique identifier, each process is uniquely identified by a PID.

• we can have concurrency within a single process—each running a single function

We will solve problems:

• never race condition
• never deadlock

thread

• you can spawn a thread using the thread() can even pass function parameters
• threads share all virtual address space: bugs can arise when multiple threads modify the same thing at the same time—each thread has access to a small chunk of the stack
• threads are actually the unit of concurrency: the OS actually chooses threads to run

// now the thread can execute at any time: once a thread is made, it will run in any order
thread myThread(function_to_run, arg1, arg2, ...);
// threads run AS SOON AS SPAWENED: so

We can wait for a thread: