Editing
Probabilistic Machine Learning
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Understanding</span> == **Why probabilistic ML?** Point predictions discard crucial information. When a medical AI says "positive for cancer" with 51% confidence, that's categorically different from 99% confidence β but a non-probabilistic classifier treats both identically. Probabilistic models express this uncertainty explicitly. **Sources of uncertainty**: (1) **Aleatoric** (irreducible): inherent randomness in the data-generating process. Even with infinite data, some outcomes are unpredictable β e.g., quantum effects, chaotic systems. (2) **Epistemic** (reducible): uncertainty due to limited knowledge. With more data, the model becomes more certain. Good probabilistic models distinguish these two types. **Probabilistic graphical models** encode joint distributions over many variables efficiently using conditional independence assumptions. A Bayesian network for medical diagnosis might have nodes for symptoms, diseases, and test results, with edges encoding conditional dependencies. Inference algorithms (variable elimination, belief propagation) compute posterior probabilities of unobserved variables. **Deep probabilistic models**: VAEs combine deep learning with variational inference. The encoder maps inputs to a distribution over latent codes (not a point); the decoder maps sampled latent codes back to reconstructions. This enables generation (sample from the latent space) and uncertainty quantification. Normalizing flows model complex distributions by composing simple invertible transformations with analytically tractable Jacobians. **Conformal prediction** provides distribution-free prediction sets with guaranteed coverage: given user-specified error rate Ξ±, the prediction set contains the true label with probability β₯ 1-Ξ±, regardless of the underlying distribution. This is a practical tool for adding rigorous uncertainty quantification to any classifier. </div> <div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information