- Inductive bias
- Spazio delle ipotesi
$H$ con ipotesi$h \in H$ - version space, spazio delle ipotesi tra gli estremi di quelle consistenti
- Ad esempio spazio delle curve polinomiali, con obiettivo minimizzare:
$min_{w} 1/n \sum_{i=1}^n (y_i - wx_i)^2$ - Training/empirical error vs ideal error
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
export type Omit<T, K> = Pick<T, Exclude<keyof T, K>>; | |
export type ValueOf<T> = T[keyof T]; | |
export function assertNever(_: never): never { | |
throw new Error('Unreachable code'); | |
} | |
export function debounce<F extends (...params: Array<any>) => void>(fn: F, delay: number): F { | |
let timer: NodeJS.Timeout; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Available variables: | |
// - Machine | |
// - interpret | |
// - assign | |
// - send | |
// - sendParent | |
// - spawn | |
// - raise | |
// - actions |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Available variables: | |
// - Machine | |
// - interpret | |
// - assign | |
// - send | |
// - sendParent | |
// - spawn | |
// - raise | |
// - actions |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![allow(non_snake_case)] | |
fn init_array<const M: usize, const N: usize>( | |
A: &mut [[f32; N]; M], | |
r: &mut [f32; M], | |
p: &mut [f32; N], | |
) { | |
for i in 0..N { | |
p[i] = (i % N) as f32 / N as f32; | |
} |
OlderNewer