abductionadjust noise variables to be consistent with \(x\)Causal inference
abductive reasoningderiving a hypothesis to explain observed phenomenonPsychology
Abel's thmif a power series converges at the point x = R > 0, the the series converges uniformly on the interval [0,R]. A similar result holds if the series converges at x = -RReal analysis
aperture problemlooking through certain hole can change perception (ex. see movement in wrong directions)Computer vision
AR model\(X_t = \sum_{i=1}^p \cblue{\phi_i} X_{t-i}+ \corange{\varepsilon_t}\)Time series
arbitrary coherencemarket prices themselves that influence consumers' willingness to pay. What this means is that demand is not, in fact, a completely separate force from supply.Psychology
arc consistencysatisfy binary constraints (every node is made arc-consistent with all other nodes)Search and logic
ARIMA model\(ARIMA(p, d, q)\): - generalizes ARMA model to non-stationarity (using differencing)Time series
ARMA model\(ARMA(p, q)\): \(X_t = \sum_{i=1}^p \cblue{\phi_i} X_{t-i} + \sum_{i=1}^q \cgreen{\theta_i} \corange{\varepsilon_{t-i}} + \corange{\varepsilon_t}\)Time series
assumptionno crossings - given a subsequence \([i,j]\), there is either no edge connecting to the ith base (meaning it is unpaired) or there is some edge connecting the ith base to the kth base where ...Omics
astrocytesin CNS, maintain chemical environment, retain stem cell propertiesBrain basics
asymmetric clusteringone machine runs while other monitors it (hot-standby mode)Operating systems
asymmetric multiprocessingboss processor controls the systemOperating systems
asynchronous cancellationone thread immediately terminates target threadOperating systems
asynchronous policy iterationdon't have to update all states at onceRL and decisions
atomic sentenceformed from a predicate symbol optionally followed by a parenthesized list of termsSearch and logic
availability heuristicjudging the frequency or probability of an event by the ease with which examples of the event come to mindCognitive science
axiom of completenessevery nonempty set \(A \subseteq \mathbb{R}\) that is bounded above has a least upper boundReal analysis
B
back-door criterionestablishes if variables \(T\) and \(Y\) are confounded in a graph given set \(S\)Causal inference
backfittingtraditional way to fit - each \(f_i\) is fitted sequentially to the residuals of the previously fitted \(f_0,...,f_{i-1}\) (hastie & tibshirani, 1989)Interpretability
backjumpingbacktracks to most recent assignment in conflict setSearch and logic
backpropagationapplication of reverse mode automatic differentiation to neural networks's lossDeep learning
backtracking searchdfs but only one successor is generated at a time; each partially expanded node remembers which succesor to generate nextSearch and logic · Search and logic
baggingbootstrap aggregation - an ensemble methodClassification
balanced treeno 2 nodes differ in height by more than 1Data structures
bandwidthtotal number of bytes transferred, divided by timeOperating systems
basal forebrainspread synapses all over cortexDisease
base rate neglectgrounding one’s judgments in how well sets of characteristics feel like they fit together, and neglecting how common each characteristic is in the population at largeCognitive science
biased proxydo proxy variables (e.g. weight/height) properly capture the legitimate target variable?Fairness and STS
Bidirectional / unmasked self-attentionprimary/context vectors are the sameLLMs
bidirectional searchsearch from start and goal and see if frontiers intersectSearch and logic
binary cross entropy losscorresopnds to bernoulli distr., most common - doesn't penalize (0.1, 0.2) and (0.4, 0.5) the same way, which might be problematicDisentanglement
cantor's thmGiven any set A, there does not exist a function f:\(A \to P(A)\) that is ontoReal analysis
capsulevector specifying the features of an object (e.g. position, size, orientation, hue texture) and its likelihoodComputational neuroscience
cascading terminationif parent dies, its children dieOperating systems
cathexisthe concentration of mental energy on onen particular person, idea, or object (esp. to an unhealthy degree)Psychology
cauchy condensation testsuppose \(a_n\) is decreasing and satisfies \(a_n \geq 0\) for all \(n \in \mathbb{N}\). Then, the series \(\sum_{n=1}^\infty a_n\) converges iff the series \(\sum_{n=1}^\infty 2^na_{2^n}\) convergesReal analysis
cauchy criteriona sequence converges \(\iff\) it is a cauchy sequenceReal analysis
cauchy criterion for seriesseries converges \(\iff\) \((s_m)\) is a cauchy sequenceReal analysis
causal processleaves marks on the world which persist spatiotemporally (these marks hint at counterfactuals)Philosophy
causal responsibilityto which cause(s) do we attribute a given effect?Psychology
causal transportabilityseeks to identify conditions under which causal knowledge learned from experiments can be reused in different domains with observational data onlyCausal inference
CerebrumThe cerebrum is the largest portion of the brain, and contains tools which are responsible for most of the brain's function. It is divided into four sections:Brain basics
certainty effectpeople are drawn to things that are certainRL and decisions
chain rulelet f:A-> R and g:B->R satisfy f(A)\(\subseteq\) B so that the composition g \(\circ\) f is defined. If f is differentiable at c in A and g differentiable at f( c) in B, then g \(\circ\) f is ...Real analysis
change blindnessblind to things you're not attending toVision
change factual associationsmodify feedforward weights to update specific factual associations using Rank-One Model Editing (ROME)LLMs
change the inputshow can we make it more natural for humans to specify what they want?Interpretability
change the loophow can humans direct where / when machine aid is helpful?Interpretability
change the outputshow can we help humans understand and solve their own problems?Interpretability
chebyshev's\(P(\vert X-\mu\vert \geq a) \leq \frac{Var[X]}{a^2}\)Stat basics
chi-squared\(\chi_d^2\) ~ \(\sum_i^d U_i^2\) w/ d degrees of freedomTesting
china brainwhat if different people hit buttons to fire individual neuronsCognitive science
chinese room argumentrebuts turing test { cite searle1980minds }Cognitive science
church-turing thesisa function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machineCognitive science
completenesswhen all statements which are true (in some imageinable world), and which can be expressed as well-formed strings of the system, are theoremsCognitive science
complex cellssimple cells with some shift invariance (oriented lines but with shifts)Computer vision
computational complexityhow much computational effort needed to convergeLearning theory
computer systemhierarchical approach = layered approachOperating systems
concept learningacquiring the definition of a general category given a sample of positive and negative training examples of the categoryLearning theory · Search and logic
cone\(\theta \geq 0 \implies \theta x \in C\)Optimization
confidencepredicted probability = confidence, max margin, entropy of predicted probabilities across classesUncertainty
confidence intervalif multiple samples of trained typists were selected and an interval constructed for each sample mean, 95 percent of these intervals contain the true preferred keyboard heightTesting
confidence intervalstake sample data + produce a range of values that likely contains population parameter you are interested inStat basics · Interpretability
confoundingdifference between groups other than the treatment which affects the responseCausal inference
conic form problem\(\min \: c^Tx \\ s.t. \: Fx +g \preceq_K 0\\Ax=b\) ~ set \(K=S_+^K\)Optimization
conjunction fallacyhumans assign a higher probability to a proposition of the form “A and B” than to one of the propositions “A” or “B” in isolationCognitive science
conjunction searchconjunction of features (ex. red circle) takes longerVision
conservative approximationcontains belief state, but also extraneous stuffSearch and logic
context-free grammarset of grammar rules that define a grammNLP
contiguous memory allocationeach process has a sectionOperating systems
continuous limit thmLet (\(f_n\)) be a sequence of functions defined on A that converges uniformly on A to a function f. If each \(f_n\) is continuous at c in A, then f is continuous at cReal analysis · Real analysis
contractionfunction that brings variables togetherRL and decisions
contrastive lossInfoNCE loss uses cross-entropy loss to measure how well the model can classify the “future” representation among a set of unrelated “negative” samplesUnsupervised
counterfactualrelating to or expressing what has not happened or is not the caseCognitive science
counterfactual explanationslike adversarial, counterfactual explanation describes smallest change to feature vals that changes the prediction to a predefined outputInterpretability
counterfactual fairnessreplace attributes w/ flipped valuesFairness and STS
counterfactual memorizationdifference between a training data’s expected loss under a model that has and has not been trained on that dataLLMs
countingkeep track of ptr to next block and the number of free blocks after thatOperating systems
daemonssystem programs for receiving connections (like servers waiting for a client)Operating systems
Darboux's thmif f is differentiable on an interval [a,b], and a satisfies f'(a) \(\alpha\) > f'(b)), then there exists a point c \(\in (a,b)\) where f'( c) = \(\alpha\)Real analysis
diameter of state spacelongest possible distance to goal from any startSearch and logic
difference in means\(\hat \tau = \hat{\bar{Y}}^{T=1} - \hat{\bar{Y}}^{T=0}\)Causal inference
differentiable limit theoremlet \(f_n \to f\) pointwise on the closed interval [a,b], and assume that each \(f_n\) is differentiable. If \((f'_n)\) converges uniformly on [a,b] to a function g, then the function f is ...Real analysis · Real analysis
differential privacyremoving any data from the training set should not considerably change trained modelsLLMs
dynamic loadingdon't load whole process, only load things when calledOperating systems
dynamically linked librariessystem libraries linked to user programs when the programs are runOperating systems
E
E-valuemin strength of association (risk ratio) that an unmeasured confounder would require with both \(T\) and \(Y\) to explain away a specific treatment-outcome association, conditional on \(X\)Causal inference
ecologically imposedif people are struggling to survive, a woman shouldn't share a man with anotherPsychology
edgeplace of rapid change in the image intensity functionComputer vision
edinger westphal nucleuspupil-constrictionMotor system
effect axiomsspecify the effect of an action at the next time stepSearch and logic
effective branching factorif total nodes generated by A is N and solution depth is d, then b is branching factor for uniform tree of depth d for N+1 nodes: \(N+1 = 1+b^ +(b^)^2 + ... + (b^)^d\)Search and logic
efficient codingin order to have maximum entropy output, a good encoder should match its outputs to the distribution of its inputsComputational neuroscience
efficient coding hypothesisbrain learns different combinations (e.g. lines) that can efficiently represent imagesComputational neuroscience
efficiently PAC learnabletime that is polynomial in \(1/\epsilon, 1/\delta, n, size(c )\)Learning theory
eidetic memorizationa string s is k-eidetic memorized by LLM \(f\) if a prompt p exists such that \(f(p) = s\) and s appears at most k times in the training setLLMs
eigenvalue eqn\(Ax = \lambda x \implies (A-\lambda I)x=0\)Linear algebra
equalized oddspredictions are independent of group given labelFairness and STS
equifinalityperturb behavior (like use grayscale images instead of color) and they can still do it (like stability)AI futures
equivalent heuristicscompatible heuristics \(H\), \(G\) rank rules in the same order (antagonistic rank rules in opposite order)Search and logic
ergodicstronger condition, says samples approach the expectation of functions on the time series: for any function \(g\) and shift \(\tau_1, ... \tau_k\):Time series
ex. program inductiongiven a dataset consisting of input/output pairs, generate a (simple?) program that produces the same pairsInterpretability
exact line search\(t = \underset{s \geq 0}{\text{argmin}} \:f(x+s \Delta x)\)Optimization
exclusion restriction\(Y_i^{I=1} = Y_i^{I=0}\) for always-takers and never-takersCausal inference
exclusion restrictionsFor every variable \(Y\) having parents \(PA(Y)\) and for every set of endogenous variables \(S\) disjoint of \(PA(Y)\), we have \(Y^{PA(y)} = Y^{PA(Y), S}\)Causal inference
existential instantiationvariable is replaced by a new constant symbolSearch and logic
exogenous attentioninvoluntary, fast effortless, disruptiveVision
exogenous variable = ydependent variableTime series
exogenous variablesnoise variables = disturbances = errors - node in the network that represents all the data not collectedCausal inference
expectation stepvalues of unobserved latent variables are filled inOptimization
experience replayinstead of learning from samples one by one, want to reduce correlation between subsequent samplesRL and decisions
expert systemprogram that contains some of the subject-specific knowledge of one or more human experts.Cognitive science
explanandumsentence describing phemonenon to be explainedPhilosophy
explanansclass of sentences used to account for the phenomenonPhilosophy
explanation evaluationprocesses an explainee uses to evaluate the quality of an explanationPsychology
explanation generationexplains the proxy (ex. just give most important 2 features in rule list proxy, ex. LIME gives coefficients of linear model, Shap: sums of elements)Interpretability
explanation selectionprocess people use to select a small subset of identified causes as the explanationPsychology
explanation subsystemprovide explanation of reasoning that led to conclusionCognitive science
explicit graph methodsassume explicit knowledge of graph representing the data-generating processCausal inference
exploding gradients problemgradients are significantly larger in earlier layers than later layersDeep learning
extended value extension\(\tilde{f}(x) = f(x)\) if \(x \in dom f\) else \(\infty\)Optimization
external fragmentationthere is enough free mem, but it isn't contiguousOperating systems
extreme value theoremif f if continuous on a compact set K, then f attains a maximum and minimum value. In other words, there exist \(x_0,x_1 \in K\) such that \(f(x_0) \leq f(x) \leq f(x_1)\) for all x \(\in\) KReal analysis
foreshorteningobjects slanted w.r.t line of sight become smaller w/ scaling factor cos \(\sigma\) ~ \(\sigma\) is angle between line of sight and the surface normalComputer vision
forward checkingwhen we assign a variable in search, check arc-consistency on its neighborsSearch and logic
forward/backward chainingchecks if q is entailed by KB of definite clausesSearch and logic
fraction of variance explained\(R^2 = \cblue{var(X \hat{\theta})} / \cpurple{var(Y)}\)Linear models
frame axiomsassert that all propositions remain the same under actionsSearch and logic
frame representationssemantic networks where nodes have structureCognitive science
framing effectwording can influence people's judgementsRL and decisions
free-energy principle\(a, \mu, m = \arg\min F(\tilde{s}, \mu \vert m)\) - minimization of the free energy of sensations and the representation of their causesComputational neuroscience
front-door criterionestablishes if variables \(T\) and \(Y\) are confounded in a graph given mediators \(M\)Causal inference
Frontal LobeThis lobe controls a several elements including creative thought, problem solving, intellect, judgment, behavior, attention, abstract thinking, physical reactions, muscle movements ...Brain basics
frontieropen list = set of all leaf nodes available for expansion at any given pointSearch and logic
generalized mean value theoremif f and g are continuous on the closed interval [a,b] and differentiable on the open interval (a,b), then there exists a point c \(\in (a,b)\) where \|f(b)-f(a)\|g'( c) = \|g(b)-g(a)\|f'( ...Real analysis
generate permutationsrecursive, add char at each spotAlgorithms
greedy best-first searchlet f = h: keep expanding node closest to goalSearch and logic
grid cellsin the entorhinal cotex (provides inputs to the hippocampus) - not particular locations but rather hexagonal coordinate systemComputational neuroscience
grid-based hypothesis testssplitting the sample space (X, Y) into grids and then testing whether the patterns of sample distributions across different grid cells are randomInterpretability
groundingconnection between logic and real environment (usually sensors)Search and logic
GroupDROdistributionally robust optimization (e.g. encourage strict equality between err of each group)Causal inference
groupingblock stores n-1 free blocks and 1 pointer to next blockOperating systems
Grover's algorithmwith quantum computers, something like you can only use sqrt of number of stepsQuantum computing
Heuristic Search Hypothesissolutions are represented as symbol structures. A physical symbol system exercises its intelligence in problem solving by search--that is, by generating and progressively modifying symbol ...Cognitive science
instantaneous codeno code word is a prefix of another code wordInformation theory
instrumentmeasurable quantity that correlates with the treatment, and is \(\underbrace{\cblue{\text{only related to the outcome via the treatment}}}_{\textbf{exclusion restriction}}\)Causal inference
instrumental rationalitysystematically achieving your valuesCognitive science
instrumental variable criterionsufficient condition for identifying the causal effect \(P(y\vert do(t))\) is that every path between \(T\) and any of its children traces at least one arrow emanating from a measured variableCausal inference
integrable limit thmAssume that \(f_n \to f\) uniformly on [a,b] and that each \(f_n\) is integarble. Then, f is integrable and \(\lim_{n \to \infty} \int_a^b f_n = \int_a^b f\).Real analysis · Real analysis
intelligent agentsystem that perceives its environment and takes actions that maximize its chances of successCognitive science
inter-class discriminativefeatures of samples from different classes/clusters are uncorrelated + different low-dim linear subspacesDisentanglement
interior extremum thmlet f be differentiable on an open interval (a,b). If f attains a maximum or minimum value at some point c \(\in\) (a,b), then f'( c) = 0.Real analysis
intermediate value theoremLet f:[a,b]\( \to R\) be continuous. If L is a real number satisfying f(a) L > f(b), then there exists a point c \(\in (a,b)\) where f( c) = LReal analysis
internal fragmentationextra mem a proc is allocated but not using (because given in block sizes)Operating systems
IRMinvariant risk minimization (v1) - find a feature repr. such that the optimal classifier, on top of that repr., is the identity function for all environmentsCausal inference
irradiancehow much light (photons) is captured in some time intervalComputer vision
L'Hospital's Rule: 0/0let f and g be continuous on an interval containing a, and assume f and g are differentiable on this interval with the possible exception of the point a. If f(a) = g(a) = 0 and g'(x) ≠ 0 ...Real analysis
Manichaeismpolarization, believing one side onlyPsychology
many-to-one modelmaps user-level threads to one kernel threadOperating systems
Markov chain monte carloex. Gibbs sampling, Metropolis-HastingsGraphical models
markov conditiongiven parents, node is conditionally independent of its non-descendantsGraphical models
markov decision processall these things are givenRL and decisions
markov's\(P(X \geq a) \leq \frac{E[X]}{a}\)Stat basics
mathematistrydevelopment of theory for theory's sakeData science
max-unpoolinguse positions from pooling layerComputer vision
maximally diversedimension (or variance) of features for each class/cluster should be as large as possible as long as uncorrelated from other classes/clustersDisentanglement
maximization stepparameters are adjusted based on filled-in variablesOptimization
mean value theoremif f:[a,b] -> R is continuous on [a,b] and differentiable on (a,b), then there exists a point c \(\in\) (a,b) where \(f'( c) = \frac{f(b)-f(a)}{b-a}\)Real analysis
mean-field variational inferenceeach point has its own params (e.g. different encoder DNN) vs amortized inference - same encoder for all pointsUnsupervised
measurenonnegative real function from a delta-ring F such that \(m(\empty) = 0\) and \(m(A) = \sum_n m(A_n)\)Scattering transform
message passingmessages between coordinating processesOperating systems
message-passing protocola node can send a message to a neighboring node when, and only when, it has received messages from all of its other neighbors (parallel algorithm)Graphical models
model averaging\(p(x_{new}\vert x) = \int dm \int d\theta \: p(x_{new}\vert \theta, m) p(\theta\vert x, m) p(m\vert x)\)Stat basics
model checkingtry everything to see if A \(\implies\) BSearch and logic
model does not actually change that muchpredictions when manipulating pixels in order of saliency remains similar, very different from random (fig 4)Interpretability
model relianceMR - like permutation importance, measures how much a model relies on covariates of interest for its accuracyInterpretability
Model-based RLestimate the transition model, and then...RL and decisions
model-class relianceMCR = highest/lowest degree of MR within a class of well-performing modelsInterpretability
modularityif each dimension of r(x) depends on at most a factor of variation using their mutual infoDisentanglement
moment parameterization\(p(x\vert\eta, \Omega) = \text{exp}\left( a + \eta^T x - \frac{1}{2} x^T \Omega x\right)\) ~ also called information parameterizationStat basics
multiprogrammingincreases CPU utilization so CPU is always doing somethingOperating systems
multisetbag (stores set with frequency counts) - can store things with order by adding them multiple times, but hard to actually retrieve frequenciesComputational neuroscience
mutual exclusion2 processes can't concurrently do critical sectionOperating systems
mutual info gap MIGChen et al. 2018 - mutual info to compute the same thingDisentanglement
mutual info I(X; Y)how much you can predict about one given the otherInformation theory
MYCINone of first successful expert systems { cite shortliffe2012computer }Cognitive science
myopicgreedily obtain evidence which yields highest VPI until some thresholdRL and decisions
N
n-armed banditpulling n levelers on a slot machine, each with different distr.RL and decisions
Nested Compact Set Propertyintersection of nested sequence of nonempty compact sets is not emptyReal analysis
nested interval propertyfor each \(n \in N\), assume we are given a closed interval \(I_n = [a_n,b_n]=\{ x \in \mathbb{R} : a_n \leq x \leq b_n \}\) Assume also that each \(I_n\) contains \(I_{n+1}\). Then, the resulting ...Real analysis
orthogonal complementset of orthogonal vectorsLinear algebra
orthogonal matrixall columns are orthonormalLinear algebra
orthogonal transformationspreserves inner products \(\forall a,b \: a \cdot b =a^T A^TA b\)Computer vision
orthographic projectionappproximation to perspective when object is relatively farComputer vision
Outer Alignmentchoose the right loss functions or reward fuctions and ensure that the training objectives of AI systems match human values.Interpretability
p-valueprobability, calculated assuming that the null hypothesis is true, of obtaining a value of the test statistic at least as contradictory to \(H_0\) as the value calculated from the available ...Testing
PAC learnableconsider concept class C defined over set of instances X of length n and a learner L using hypothesis space HLearning theory
padding maskadd zeros to the end of the sequenceLLMs
page-fault frequencyadd / decrease pages based on targe page-fault rateOperating systems
path consistencyconsider constraints on triplets - PC-2 algorithmSearch and logic
path modelgraphical way to represent a regression equationLinear models
pathological stagingelements of staging pTNMDisease
pathologybranch of medicine where you take some tissue from a patient (e.g. tumor), look at it under a microscope, and make an assesment of what the disease isML in medicine
pattern databaseheuristic stores exact solution cost for every possible subproblem instanceSearch and logic
Perron-Frobenius thmif A is a positive matrix (positive values), so is its largest eigenvalue and every component of the corresponding eigenvector is also positiveLinear algebra
persistent failure modeladditional variable describing status of battery meterGraphical models
peter-clark (PC) algorithmfirst learns undirected graph, then detects edge directions and returns equivalence classCausal inference
position vectoradd this into the embedding of each word (so words know how far apart they are) - usually use sin/cos rather than actual position numberLLMs
power methodwant to find eigenvector \(v\) corresponding to largest eigenvalueLinear algebra
power spectrumhow much of the signal is at a frequency \(\omega\)? - square of the magnitude of the coefficients of the Fourier coefficients for \(\omega\)Signal processing
pragmaticsstudy of the way in which context during communication contributes to meaningNLP
prioritized sweepingprefer adjustments to states whose likely successors have just undergone a large adjustment in their own utility estimates (speeds things up)RL and decisions
proactive methodsmake assumptions about possible set of target distrs.Causal inference
probit distr\(P(buys\vert Cost=c) = \phi[(\mu - c)/\sigma]\) - integral of standard normal distrGraphical models
representer valuesdecompose pre-activation single prediction of a DNN into linear combinations of training points - weights are the representer valuesInterpretability
request edgedirected edge from process P to resource R means P has requested instance of resource type ROperating systems
residual + normalizeafter self-attention layer, often have residual connection to previous input, which gets added then normalizedLLMs
resolution ruleresolves different rules with each other - leads to complete inference procedureSearch and logic
resource constraintatmost constraint - sum of variable must not exceed some limitSearch and logic
restricted labelinggiven labels for some groundtruth factors (e.g. label "glasses", "gender" for all images)Disentanglement
restriction biaslanguage bias - models that can't express entire space (e.g. linear)Stat basics
reticularfeedforward = anticipate things before they happenMotor system
reticular formationfeedforward, prepares digestion before we eatMotor system
sampling ratethe number of samples taken per second (Hz)Signal processing
SAPKumar et al. (2017) - how much does top latent factor match gt more than 2nd latent factorDisentanglement
sapir-whorf hypothesisunderstanding of the world is influenced by the language we speakSearch and logic
satisfiability threshold conjecturefor random clauses, probability of satisfiability goes to 0 or 1 based on ratio of clauses to symbolsSearch and logic
second moment matrixneed this to be high enough rankComputer vision
second-order / weak stationaritymean is constant for all t and, for any t and k, the covariance between \(X_t\) and \(X_{t+k}\) only depends on the lag difference kTime series
secondary2d analysis of hydrogen bonds between rna parts (double-strands, hairpins, loops) - most of stabilizing free energy comes from here (unlike proteins, where tertiary is most important)Omics
sector slippingjust renumbers to not index bad blocksOperating systems
self-attentionlayer that lets word learn its relation to other layersLLMs
semanticsstudy of the meaning of words / word combinationsNLP · Cognitive science
semidecidablealgorithms exist that say yes to every entailed sentence, but no algorithm exists that also says no to every nonentailed sentenceSearch and logic
sensitizationassociate two stimuli together: !Brain basics
Sensory CortexThe sensory cortex, located in the front portion of the parietal lobe, receives information relayed from the spinal cord regarding the position of various body parts and how they are ...Brain basics
separating hyperplane thmC, D convex \(C \cap D =\emptyset \implies \exists a \neq 0, b \: s.t. \\ a^Tx \leq b \forall x \in C, \\a^Tx \geq b \forall x \in D\)Optimization
technological determinismtheory that assumes that a society's technology determines the development of its social structure and cultural valuesFairness and STS
technologysmaller or larger pieces or systems of hardware of a specific kind.Fairness and STS
temporal-difference learningadjust utility estimates towards local equilibrium for correct utilitiesRL and decisions
term-by-term continuity thmlet \(f_n\) be continuous functions defined on a set A \(\subseteq\) R and assume \(\sum f_n\) converges uniformly on A to a function f. Then, f is continuous on A.Real analysis
term-by-term differentiability thmlet \(f_n\) be differentiable functions defined on an interval A, and assume \(\sum f'_n(x)\) converges uniformly to a limit g(x) on A. If there exists a point \(x_0 \in [a,b]\) where ...Real analysis
tethered hacking intervalstake any model with small enough loss on the dataInterpretability
unbounded bufferproducer can keep producing indefinitelyOperating systems
unconfounded children criterionif it is possible to block all backdoor paths from \(T\) to all of its children that are ancestors of \(Y\) with a single conditioning set \(S\), then \(P(Y=y\vert do(T=t))\) is identifiable (tian ...Causal inference
Unidirectional / masked self-attentionmask scores from before a given wordLLMs
unificationfinding substitutions that make different logical expressions look identicalSearch and logic · Philosophy
uniform-cost searchalways expand node with lowest path cost g(n)Search and logic
uninformedgiven no info about problem besides definitionSearch and logic
universal codeone code such that no matter which \(x^n\) arrives, length is not much longer than the shortest length among all considered codesInformation theory
universal instantiationwe can infer any sentence obtained by substituting a ground term for the variableSearch and logic
universal modelprob. distr corresponding to universal codesInformation theory
upcallkernel informs application about certain eventsOperating systems
uretheliuminner layer that is able to stretch (has many layers) - this is where cancer originatesDisease
user interfacecommand-line interface and graphical user interfaceOperating systems
utility functionlottery that satisfiers certain properties (e.g. transitivity)RL and decisions
wide sense convex func\(f(x) = \inf \{ t \in \mathbb{R} \vert (x, t) \in F\}\) where \(F \subseteq \mathbb{R}^{n+1}\)Optimization
wide sense functioncan take on values \(\pm \infty\)Optimization
Wierstrass M-TestFor each n in N, let \(f_n\) be a function defined on a set A \(\subseteq\) R, and let \(M_n > 0\) be a real number satisfying \(\vert f_n(x)\vert ≤ M_n\) for all x in A. If \(\sum M_n\) converges ...Real analysis
wilcoxon rank sum\(W = \sum_i T_i R_i\), where \(R_i = \#\{j : Y_j \leq Y_i \}\) is the rank of \(Y_i\) in the observed samplesCausal inference
Wilsoninitial book sociobiology was vehemently opposedPsychology
windowed fourier transformchop signal into sections and analyze each section separatelySignal processing
winzorizingreplace suspect values with closest values that aren'tData science