CFU REU: Week 1 Lam Tran. Brief Introduction Home town: San Diego, CA University of Rochester, Rochester, NY – Class 2009 – Research Interest: Probability.

Slides:



Advertisements
Similar presentations
Frank Wood - Training Products of Experts by Minimizing Contrastive Divergence Geoffrey E. Hinton presented by Frank Wood.
Advertisements

Mr. Smet’s Scientific Studies APPLIED POTENTIAL AND KINETIC ENERGY.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Statistics 101 Class 8. Overview Hypothesis Testing Hypothesis Testing Stating the Research Question Stating the Research Question –Null Hypothesis –Alternative.
CS 678 –Boltzmann Machines1 Boltzmann Machine Relaxation net with visible and hidden units Learning algorithm Avoids local minima (and speeds up learning)
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
Methods For Nonlinear Least-Square Problems
Optimization via Search CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Iterative Improvement Algorithms
Determining the Sample Size for Estimating p. The Confidence Interval (Point Estimate)  z  /2 (Appropriate St’d Deviation) The confidence interval is:
Samples vs. Distributions Distributions: Discrete Random Variable Distributions: Continuous Random Variable Another Situation: Sample of Data.
Major Points An example Sampling distribution Hypothesis testing
Active Learning Strategies for Compound Screening Megon Walker 1 and Simon Kasif 1,2 1 Bioinformatics Program, Boston University 2 Department of Biomedical.
Lecture 4 Neural Networks ICS 273A UC Irvine Instructor: Max Welling Read chapter 4.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
1 More about the Sampling Distribution of the Sample Mean and introduction to the t-distribution Presentation 3.
MTH 161: Introduction To Statistics
Chapter 11Prepared by Samantha Gaies, M.A.1 –Power is based on the Alternative Hypothesis Distribution (AHD) –Usually, the Null Hypothesis Distribution.
Comparing Two Populations or Groups
Sample size determination Nick Barrowman, PhD Senior Statistician Clinical Research Unit, CHEO Research Institute March 29, 2010.
When estimating the mean, how large a sample must be used in order to assure a given level of confidence? Use the formula:
Sample Size Determination Donna McClish. Issues in sample size determination Sample size formulas depend on –Study design –Outcome measure Dichotomous.
CSC2535: Computation in Neural Networks Lecture 11: Conditional Random Fields Geoffrey Hinton.
A Brief Introduction to Power Tyrone Li ‘12 and Ariana White ‘12 Buckingham Browne & Nichols School Cambridge, MA.
● Uncertainties abound in life. (e.g. What's the gas price going to be next week? Is your lottery ticket going to win the jackpot? What's the presidential.
Warm-up 7.1 Sampling Distributions. Ch. 7 beginning of Unit 4 - Inference Unit 1: Data Analysis Unit 2: Experimental Design Unit 3: Probability Unit 4:
Radioactivity Poster. Radioactivity The emission of high energy particles or waves from unstable atoms The emissions occurs when the nucleus falls apart.
CSC 2535 Lecture 8 Products of Experts Geoffrey Hinton.
Normal Distribution The Bell Curve. Questions What are the parameters that drive the normal distribution? What does each control? Draw a picture to illustrate.
BUS304 – Chapter 6 Sample mean1 Chapter 6 Sample mean  In statistics, we are often interested in finding the population mean (µ):  Average Household.
AP Review #3: Continuous Probability (The Normal Distribution)
Losing Weight (a) If we were to repeat the sampling procedure many times, on average, the sample proportion would be within 3 percentage points of the.
Training Restricted Boltzmann Machines using Approximations to the Likelihood Gradient Tijmen Tieleman University of Toronto.
Direct and Inverse Variation. Direct Variation Two functions are said to vary directly if as the magnitude of one increases, the magnitude of the other.
Last lecture summary Which measures of central tendency do you know? Which measures of variability do you know? Empirical rule Population, census, sample,
CSC321: Introduction to Neural Networks and Machine Learning Lecture 18 Learning Boltzmann Machines Geoffrey Hinton.
WEEK 1 You have 10 seconds to name…
Learning to Rank From Pairwise Approach to Listwise Approach.
Scientific Notation.
Lecture 9 State Space Gradient Descent Gibbs Sampler with Simulated Annealing.
Week 7 Chapter 6 - Introduction to Inferential Statistics: Sampling and the Sampling Distribution & Chapter 7 – Estimation Procedures.
Advanced Computer Graphics Optimization Part 2 Spring 2002 Professor Brogan.
T-tests Quantitative Data One group  1-sample t-test Two independent groups  2-sample t-test Two dependent groups  Matched Pairs t-test t-TestsSlide.
1 Section 8.2 Basics of Hypothesis Testing Objective For a population parameter (p, µ, σ) we wish to test whether a predicted value is close to the actual.
Computer Vision Lecture 7 Classifiers. Computer Vision, Lecture 6 Oleh Tretiak © 2005Slide 1 This Lecture Bayesian decision theory (22.1, 22.2) –General.
More about tests and intervals CHAPTER 21. Do not state your claim as the null hypothesis, instead make what you’re trying to prove the alternative. The.
Nonlinear function minimization (review). Newton’s minimization method Ecological detective p. 267 Isaac Newton We want to find the minimum value of f(x)
Practice Problems Actex 3, 4, 5. Section 3 -- #3 A box contains 4 red balls and 6 white balls. A sample of size 3 is drawn without replacement from the.
BSHS 382 Week 3 DQ 2 Check this A+ tutorial guideline at 382/BSHS-382-Week-3-DQ-2 How can you avoid bias when selecting.
CSCI 4310 Lecture 10: Local Search Algorithms
Term 1 Week 5 Warm Ups.
Towards Traffic Light Control through a Multiagent Cooperative System:
Unit 7. Day 9..
Chapter 7: Introduction to Sampling Distributions
Introduction to Probability & Statistics Expectations
The Big 6 Research Model Step 3: Location and Access
Sampling Distribution Models
Introduction to Probability & Statistics Exponential Review
Quantitative Methods PSY302 Quiz Normal Curve Review February 6, 2017
Lecture 15: Data Cleaning for ML
Chapter 7: Introduction to Sampling Distributions
Approaches to search Simple search Heuristic search Genetic search
Class projects Some of you haven’t given me your class project proposals (1 or 2 paragraphs). If you haven’t turned in your proposal or spoken with me:
Introduction to Between-Subjects Experiments
More on HW 2 (due Jan 26) Again, it must be in Python 2.7.
C.2.10 Sample Questions.
C.2.8 Sample Questions.
C.2.8 Sample Questions.
Similarities Differences
A Brief Introduction to Power
Presentation transcript:

CFU REU: Week 1 Lam Tran

Brief Introduction Home town: San Diego, CA University of Rochester, Rochester, NY – Class 2009 – Research Interest: Probability and Machine Learning

Stereo Vision (Big Picture) Learn θ

Stereo Vision 2(Big Picture) θ

Gradient Descent How to get out of local minimal Δ energy = old energy - new energy (negative) Climb out of hill Climb when Rand < Exp(beta*(Δ energy )) Rand ~ Gauss Distribution and Exp(beta* Δ energy ) ~ [0.. 1] When beta = 0, always move to new states. When beta = large, move only when new energy < old energy (stuck at local minimal, similar to gradient descent).

Gradient Descent Worst case scenario Energy gained ~ height of the hill climbed. Avoid climbing hills with high energy change Exp(beta*(Δ energy )) ~ inv proportional to Δ energy Hills with higher Δ energy has a smaller probability of being climbed.

Experimentation F(x) = alpha*sin(x) with beta = 3. – 1000 trails with 100 sample sizes – Alpha = 1, mean = 99.70% – Alpha = 2, mean = 88.45% – Alpha = 4, mean = 45.11%