[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Common errors on the final: One last mail before grades
- To: Rao Kambhampati <firstname.lastname@example.org>
- Subject: Common errors on the final: One last mail before grades
- From: Subbarao Kambhampati <email@example.com>
- Date: Mon, 7 May 2012 20:43:05 -0700
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:sender:from:date:x-google-sender-auth:message-id :subject:to:content-type; bh=yYCM5m5iVxEz2aDuM0Oly92ZMrgEDFwjOkGPKAKgpvo=; b=UJ4VEsoi7I7+VPwGmjR7nYLWIPFA497U72/v+JqdYB83mBHnLwfPBgxmy94xTgESrZ 7vLKQ2eEEF176tUp3S12hWozx0eoS9zNr9mqVOAs8w46WF3nEEK4T6BZ7qwATEpfo5Ky 8kp5VX8Z7QnYC48lKNGNHDmdifVSfzJNiS7nXgEm72HxRV+3MfkgJ6wenm6L9Js6oix2 EncJcmczX2Y5fuG/jiggPS+b4YND7xMMWkZkXNYGsdZFi5F7xMpR78pWIrPgamFYUZhI WkUWfrbfr9Gvlonx+mt50KK6Z6otAOtRFU/j02PZGHrJQ9JFZ1/G1AZcEl0tWdP32rz1 lbvA==
- Sender: firstname.lastname@example.org
Since you will be in no mood to think about any more AI once you get your grades, here is one cram-chance for two near universal errors:
1. Even after you are given the topology of a bayes network, you can reduce the number of independent parameters by using "parameterized" distributions
(such as Noisy-OR) rather than CPTs. For example, given a node with n parents, a CPT will need 2^n independent parameters, while if we decide to go with a NOISY-OR distribution, then we only need to give n parameters. (only one or two students got this right).
2. Even if a proposition p occurs in a planning graph with mutexes, it may still actually not be achievable by that level since standard mutexes only consider interactions between a pair of propositions at a time. If you have actions with >2 preconditions, it is possible that each pair of them are non-mutex, and yet all of them together are not possible. In that case, if that action gives the proposition p, you will add p in the next level, even though the action itself is not actually executable in the previous level.