All public logs
From Rice Wiki
Combined display of all available logs of Rice Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
- 05:25, 26 April 2024 Rice talk contribs created page Perceptron learning (Created page with "'''Perceptron learning''' is good for classifying ''linearly separable data'', as seen in figure 1. Category:Machine Learning")
- 05:24, 26 April 2024 Rice talk contribs created page Newton's method (Created page with "'''Newton's method''' is an alternative to Gradient Descent. In contrast to GD, which uses the first derivative to approach the optimal model, Newton's method adds the ''second derivative'' to converge ''faster''. Newton's method has the drawback of being more computationally expensive due to the need to find the second derivative. <math> w_j = w_j - a\frac{\frac{\partial l}{\partial w_j}}{\frac{\partial^2 l}{\partial w_j^2}} </math> Category:Machine Learning")
- 01:19, 26 April 2024 Rice talk contribs created page File:Logistic regression sigmoid.png
- 01:19, 26 April 2024 Rice talk contribs uploaded File:Logistic regression sigmoid.png
- 01:08, 26 April 2024 Rice talk contribs created page Logistic regression (Created page with "= Linear regression = Linear regression cannot be directly used for (binary) classification. Indirectly, a threshold is used. When the value is above the threshold, it is considered 1; when it is below, it is considered 0. Classification using linear regression is sensitive to the threshold. The problem with this approach is the difficulty in determining a good threshold.")
- 01:02, 26 April 2024 Rice talk contribs created page Binary classification (Created page with "'''Binary classification''' algorithms classify data into two categories. Detecting the presence of a trait is a common application. = Algorithms = * Logistic regression * Perceptron learning Category:Machine Learning")
- 23:41, 23 April 2024 Rice talk contribs created page Homogeneous (Created page with "In differential equations, homogeneous ODEs have RHS be 0 in standard form. Category:Differential Equations") Tag: Visual edit
- 23:25, 23 April 2024 Rice talk contribs moved page Integrating factors to Integrating factor
- 23:25, 23 April 2024 Rice talk contribs created page Separation of variables (Created page with "'''Separation of variables''' is a technique to solve differential equations. It requires the equation to be ''separable''; that is, the equation is of the form <math> y' = F(y) G(t) </math> where the RHS is the product of a function of y and a function of t. = Procedure = Divide both sides by <math>F(y)</math>, integrate, and you get an Implicit equation of y in terms of t. Category:Differential Equations") Tag: Visual edit
- 15:48, 22 April 2024 Rice talk contribs created page Critical path (Created page with "The '''critical path''' of a circuit is the slowest route to output. It is important as the time it takes for the critical path to stabilize is the fastest time a good output can come out of the circuit. Category:Computer Architecture") Tag: Visual edit
- 15:17, 22 April 2024 Rice talk contribs created page Sum of products (Created page with "The '''sum of products''' method can be used to devise circuits. = Extra notation = <math>\sum (1, 2, 4, 7)</math>") Tag: Visual edit
- 15:13, 22 April 2024 Rice talk contribs created page Add (Created page with "The '''ADD''' operator is the fundamental instruction of many arithmetic operations (such as subtract, multiply, divide, and modulo). = Input and output = ''ADD'' takes in two binary digits. It then outputs the result, which consists of a digit and a carry. In contrast to the above, which is a '''half adder''', a '''full adder''' has an additional input: '''carry-in''', which modifies the result.") Tag: Visual edit
- 16:07, 19 April 2024 Rice talk contribs created page Register file (Created page with "The '''register file (RF)''' Category:Computer Architecture") Tag: Visual edit
- 15:37, 19 April 2024 Rice talk contribs created page Bubble pushing (Created page with "On a gate, when all the inputs are inverted (i.e. bubbled), you can push the bubble through while changing the shape of the gate. This process is called '''bubble pushing'''. Category:Computer Architecture") Tag: Visual edit
- 15:22, 19 April 2024 Rice talk contribs created page Product of sums (Created page with "The '''product of sums''' is a way to derive circuits. Category:Computer Architecture") Tag: Visual edit
- 22:47, 17 April 2024 Rice talk contribs created page Logistic equation (Created page with "Of the form <math>\begin{cases} y' = y(1 - y)\\ y(0)=y_0 \end{cases}</math> The solution is <math>y(t) = \frac{y_0e^t}{y_0 e^t - (y_0 - 1)}</math> = Analysis = ''y'' is undefined at <math>t = \ln \left( \frac{y_0 - 1}{y_0} \right)</math> If ''0 < y_0 < 1,'' The solution is defined for all ''t.'' ''y(t)'' approaches 1 as t approaches infinity. ''y(t)'' approaches 0 as ''t'' approaches negative infinity. For ''y_0 > 1,'' the blowup time is negative <math>\ln \left(...") Tag: Visual edit
- 21:47, 17 April 2024 Rice talk contribs created page Integrating factors (Created page with "'''Integrating factors''' is a method to solve scalar Linear First Order ODE<nowiki/>s. Consider <math>y' + p(t) y = g(t)</math> We multiply bothsides by integrating factor <math>\mu(t)</math> such that the left hand side to be the ''exact derivative of a product.'' For this to work, we need <math>\mu' = \mu p</math> Applying the integrating factor, we have <math>\begin{aligned} \mu(t) y + \mu(t) p(t) y &= \mu(t) g(t) \\ \mu y' + \mu ' y &= \mu g \\ (\mu y)' &=...") Tag: Visual edit
- 21:33, 17 April 2024 Rice talk contribs moved page Ordinary Differential Equation to Ordinary differential equation
- 18:21, 17 April 2024 Rice talk contribs created page Maximum likelihood estimation (Created page with "'''Maximum likelihood estimation (MLE)''' is one of the methods to find the coefficients of a model that minimizes the RSS in linear regression. MLE does this by maximizing the likelihood of observing the training data given a model. = Background = Consider objective function <math>y = w_0 x_0 + w_1 x_1 + \ldots + w_m x_m + \epsilon = g(x) + \epsilon</math> where <math>y = g(x)</math> is the true relationship and <math>\epsilon</math> is the res...") Tag: Visual edit
- 15:29, 17 April 2024 Rice talk contribs created page Karnaugh map (Created page with "The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to reduce digital circuits. = Minterm = A '''minterm''' is a term that consists of all inputs, complemented or not. = Matrix = Kmap minimize equations graphically. Each cell represent an input. There cannot be more than one bit change from one column to the next. If there are more variables, multiple is placed for an axis. Note the restriction regarding b...") Tag: Visual edit
- 22:33, 15 April 2024 Rice talk contribs created page Equilibrium (Created page with "The '''equilibrium''' solution of an ODE is a value where ''y'' will not differ over time. = Stability = An equilibrium is '''stable''' if slight perturbations from the equilibrium solution will not drastically change ''y''. In contrast, an equilibrium is unstable if slight perturbation causes drastic changes.") Tag: Visual edit
- 22:20, 15 April 2024 Rice talk contribs created page Autonomous ODE (Created page with "'''Autonomous ODE's''' have no explicit t-dependence. They come in the form <math> y' = F(y) </math> = Equilibrium = Autonomous ODE's have trivial ODE solutions. If <math> F(c) = 0 </math> then <math> y(t) = c </math> is the equilibrium solution of the ODE. If <math>y(t)</math> is a solution, then so is <math>z(t) = y(t + t_0)</math> for any constant <math>t_0</math> <math> \begin{aligned} y'(t) &= F(y(t))\\ z'(t) &= y'(t + t_0) \\ &= F(y(t + t_0)) \\ &= F(z(t)...")
- 21:47, 15 April 2024 Rice talk contribs created page First Order Scalar ODE (Created page with "'''First order scalar ODEs''' are the first ODEs we study. * Scalar: One unknown * First order: ''y'''") Tag: Visual edit
- 21:24, 15 April 2024 Rice talk contribs created page Initial Value Problem (a) Tag: Visual edit
- 18:49, 15 April 2024 Rice talk contribs created page Ridge Regression (Created page with "'''Ridge regression''' is a regression model with an additional term called the ''regularizer''. The motive for this model is to discourage overfitting. It is similar to Regularization, except it more heavily punishes complex models. = Regularizer = The '''regularizer''' <math>\lambda</math> is an additional term to the loss function that penalizes higher order terms. <math>\lambda \sum \left| w_j^2 \right|</math>") Tag: Visual edit
- 18:48, 15 April 2024 Rice talk contribs created page Regularization (Created page with "'''Regularization (aka. Lasso Regression)''' is a regression model with an additional term called the ''regularizer''. The motive for this model is to discourage overfitting. = Regularizer = The '''regularizer''' <math>\lambda</math> is an additional term to the loss function that penalizes higher order terms. <math>\lambda \sum \left| w_j \right|</math>") Tag: Visual edit
- 18:35, 15 April 2024 Rice talk contribs created page Linear Regression (Created page with "'''Linear regression''' is one of the simplest used techniques for predictive modeling. It estimates a linear relationship between dependent continuous variable $y$ and attributes (aka. independent variables) $X$. <math>y = f(X)</math> There are different types * Simple linear regression: one attribute * Multiple linear regression: multiple attributes Let the following function model the true relationship between $y$ and $X$ <math>\begi...") Tag: Visual edit
- 18:30, 15 April 2024 Rice talk contribs moved page Polynomial Regression Model to Polynomial Regression
- 18:29, 15 April 2024 Rice talk contribs created page Polynomial Regression Model (Created page with "'''Polynomial regression''' describes the relationship between ''x'' and ''y'' as an n<sup>th</sup> degree polynomial.") Tag: Visual edit
- 18:25, 15 April 2024 Rice talk contribs created page Stochastic Gradient Descent (Created page with " = How it works = First, a weight <math>\bf{w}</math> is selected. This is the starting point from which we iteratively improve the solution. For ''each datapoint'' in the dataset, the ''gradient'' of the loss function with respect to weights is computed and a learning rate is selected. These two statistics determine the speed and direction the model <math>\bf{w}</math> converges to. Then, a '''GD update rule''' is used to converge the weights to the desired outcome ba...") Tag: Visual edit
- 18:23, 15 April 2024 Rice talk contribs created page Batch Gradient Descent (Created page with "In '''batch gradient descent''', the unit of data is the entire dataset, in contrast to Stochastic Gradient Descent whose unit of data is one data point. It uses the ''average of the computed gradients'' to update the weights of a ''batch'' of data points. * Faster * Less performing/precise (not always)") Tag: Visual edit
- 18:14, 15 April 2024 Rice talk contribs created page Gradient Descent (Created page with "= How it works = After processing all data points, all weights are updated and 1 '''epoch''' is completed. == GD Update Rule == The '''GD update rule''' is used to update the weights after an iteration. === LMS === Least-mean-squared is a GD update rule.") Tag: Visual edit
- 15:33, 15 April 2024 Rice talk contribs created page FISC (Created page with "= Supoperator = Since there are free bits in ''NOT'', we can assign more sub operators as long as they take less than 3 registers. * ASR") Tag: Visual edit
- 15:33, 15 April 2024 Rice talk contribs created page ASR (Created page with "'''Arithmetic shift right (ASR)''' is a single-register instruction. ''ASR rd'' It shifts the destination register to the right by one bit, assigning 0 to the lowest bit. Notably, it is a ''no-delay'' circuit. Category:Computer Architecture") Tag: Visual edit
- 15:28, 15 April 2024 Rice talk contribs created page ALU (Created page with "= Suboperator = Sometimes, free bits in an instruction allows for suboperator. This involves additional parsing on the circuit, such as another MUX under NOT.") Tag: Visual edit
- 21:14, 8 April 2024 Admin talk contribs moved page Ordinary Differential Equations to Ordinary Differential Equation without leaving a redirect
- 21:14, 8 April 2024 Admin talk contribs deleted page Ordinary Differential Equation (content was: "Category:Differential Equations An '''ordinary differential equation (ODE)''' relates a function and its derivatives. We usually use <math>y</math> to denote the function and <math>t</math> to denote the variable. ''Ordinary'' means that the equation has one variable, as opposed to partial differential. There is ''no general solution'' to ODEs. We separate them by classes and so...", and the only contributor was "Rice" (talk))
- 21:13, 8 April 2024 Rice talk contribs moved page Ordinary Differential Equations to Ordinary Differential Equation
- 21:12, 8 April 2024 Rice talk contribs created page Linear First Order ODE (Created page with "Category:Differential Equations '''Linear first order Ordinary_Differential_Equation''' Homogeneous of g(t) = 0 Constant coefficient if p(t) = a is a constant. Otherwise, variable coefficient. Examples: y' + ty = 2 nonhomogeneous, var y' + 2y = 2 nonhomogeneous, constant y' + 2y = 0 homogeneous, constant Factor emthod 2.1 y' + p(t) y = g(t) Compute integrating factor mu(t) = exp(int p(t) dt)")
- 19:44, 8 April 2024 Rice talk contribs created page Pathfinder 2e/Encounter (Created page with "When moments matter, use '''encounter mode'''.")
- 19:42, 8 April 2024 Rice talk contribs moved page Godot/Key Concepts to Topic: Godot/Key Concepts
- 19:42, 8 April 2024 Rice talk contribs moved page Godot to Topic: Godot
- 19:41, 8 April 2024 Rice talk contribs created page Topic: Pathfinder 2e (Created page with "This page contains information about '''Pathfinder 2e''', the TTRPG that's better than D&D. Most information comes from [https://2e.aonprd.com/ Archives of Nethys], and mostly to pay attention while reading it.") Tag: Visual edit
- 18:40, 8 April 2024 Rice talk contribs created page Curve Fitting (Created page with "'''Curve fitting''' is the process of defining/determining (''fit'') a function (''curve'') that best approximates the relationship between dependent and independent variables. * '''Underfitting''' is when models are too basic * '''Overfitting''' is when models are too complex, which may lead to incorrect predictions for values outside of the training data. = Underfitting = Visualize the fit of the model on the test data and bias variance tradeoff. If a model has ''hi...") Tag: Visual edit
- 18:31, 8 April 2024 Rice talk contribs created page File:BiasVarianceTradeoff-scott fortmann-roe com.png
- 18:31, 8 April 2024 Rice talk contribs uploaded File:BiasVarianceTradeoff-scott fortmann-roe com.png
- 18:51, 3 April 2024 Rice talk contribs created page Category:Machine Learning (Created page with "Category:Computer Science") Tag: Visual edit
- 18:13, 3 April 2024 Rice talk contribs created page Exploratory Data Analysis (Created page with "'''Exploratory data analysis (EDA)''' is the first step in the Machine Learning pipeline. It allows us to make informed decisions about tools used to analyze the data. * Look at features of data * Look at correlated features * Find trends and unusual characteristics") Tag: Visual edit
- 20:39, 2 April 2024 Admin talk contribs deleted page 2's Complement (content was: "'''2's complement''' is a method of representing integers in computer science. To calculate the value of a number represented by 2's complement, just think of the first bit in the bit pattern as negative. For example, 101 would be 4 + 1 = 5 as an unsigned number, but -4 + 1 = -3 as a signed number represented by 2's complement. The advantage of using 2's complement over signed magnit...", and the only contributor was "Rice" (talk))
- 20:22, 2 April 2024 Admin talk contribs created page Category:Computer Architecture (Created page with "Category:Computer Science") Tag: Visual edit