Different ways to disseminate information:

- Publishing 
- Research
- Communication
- Storytelling
- Social media 

Methods of Information Dissemination

Information dissemination is to distribute or broadcast information. The distribution and the spreading of information of all kinds to the users.

Syracuse University

Knowledge gained through sensation, experience, study, investigation or instruction, or the communication of attained knowledge.

Information

Joseph, J. L. (2008). Intelligence and Security Informatics. In G. Garson, & M. Khosrow-Pour, D.B.A. (Eds.), Handbook of Research on Public Information Technology (pp. 378-385). IGI Global. http://doi:10.4018/978-1-59904-857-4.ch036

Handbook of Research on Public Information Technology 

A theory is a broad explanatory framework that accounts for larger bodies of data and interprets phenomena. In psychological research, working with theories is a basic, essential ingredient, serving as the foundation from which specific hypotheses are derived and tested. Crucially, theories can be supported by evidence but can never be definitively proved, and disconfirming a single hypothesis does not necessarily mean that the broader theory has been disproved.

Theory

Concepts are mental categories used to group and organize various types of information, such as linguistic data, images, ideas, and memories. They function as cognitive structures or 'big ideas' that are formed by observing, categorizing, and combining specific details. This organizational system allows the mind to perceive relationships between different elements of experience, making information more organized and accessible. Concepts are influenced by semantic memory and are integral to every aspect of life, being particularly noticeable in educational settings where they are explicitly taught.

Concept

Information that is (verifiably) misleading, false, or incomplete. Misinformation can be created with or without the intent to misinform the public. 

Misinformation 

When an information seeker is presented with an abundance of possible sources which can be difficult to sift through. This can cause relevant information to a search query to be overlooked. 

Information Overload

Prototypes

- Reference Works
- Periodicals
- Websites
- OpenStax

General Knowledge References

Information References

The knowledge and skills needed for a specific activity or topic. There are multiple types of literacy including media, digital/technological, information, etc.

Literacy

There are three distinguished uses of the term:

1. Information-as-thing

2. Information-as-process

3. Information-as-knowledge

The Three Forms of Information

Information Disciplines

Information Dissemination

In a straightforward implementation of a distributed summation, such as calculating $$\sum_{\mathbf{k}_{j'} \in \mathbf{K}^{[u]}} \exp(\beta_{i,j'})$$ across sequence segments, a two-step process is utilized. First, the individual summations are executed independently on their respective computing nodes (e.g., node $$u$$ computes the sum for its assigned keys). Subsequently, these partial results are gathered from the various nodes and aggregated together to produce the final, combined total.

Distributed Summation Implementation

The formula $$\mathbf{k}'_i = \phi(\mathbf{k}_i)$$ describes the transformation of an original vector $$\mathbf{k}_i$$ into a new vector $$\mathbf{k}'_i$$ by applying a transformation function or map $$\phi$$. In this formula, the bold notation indicates vector quantities, and the subscript $$i$$ denotes that the operation is performed on an individual element within a set or sequence of vectors. In the context of Large Language Models, this formula can represent the transformation of key vectors within an attention mechanism.

Vector Transformation Formula

Square brackets `[ ]` are a standard notational convention in mathematics and computer science used to enclose the elements of a matrix. A matrix is a rectangular array of numbers, symbols, or expressions organized into rows and columns. The elements are written inside the brackets to define the matrix.

Matrix Bracket Notation

Query, Key, and Value are fundamental components of attention mechanisms, which allow a model to focus on relevant parts of an input sequence.
- **Query**: Represents the current context or element for which attention is being calculated. In the provided diagram, these are the multiple blue squares.
- **Key**: A label or identifier for a piece of information stored in memory. It is compared with the query to determine relevance. In the diagram, this is the green square labeled 'key'.
- **Value**: The actual content or information associated with a key. When a key is deemed relevant by a query, its corresponding value is retrieved. In the diagram, this is the green square labeled 'value'.
The interaction involves comparing a query with a set of keys to compute weights, which are then applied to the corresponding values to produce an output.

Query, Key, and Value in Attention Mechanisms

In mathematical notation, a bar placed over a variable, such as $\bar{y}$, typically represents the average or mean value of that variable. This notation can be applied to scalars or vectors. For instance, $\bar{\mathbf{y}}$ denotes a mean vector, where the bold font indicates it is a vector. A subscript, as in $\bar{\mathbf{y}}_k$, is used to index a specific average value or vector within a set or sequence.

Average Value Notation ($\bar{y}$)

The notation $q(\hat{y}_{i+t})$ represents a function, denoted by $q$, applied to a predicted value. The argument of the function, $\hat{y}_{i+t}$, signifies the predicted value (indicated by the hat symbol over $y$) of a variable $y$ at a future time step, indexed by $i+t$.

Function of a Predicted Future Value Notation ($q(\hat{y}_{i+t})$)

The formula $$i - n_c + 1$$ is used to calculate the starting index of a sequence or window of a specific length, denoted by $$n_c$$, that ends at the current position $$i$$. For instance, this calculation determines the first element in the set of sequential vectors $$\{ \mathbf{k}_{i-n_c+1}, \dots, \mathbf{k}_i \}$$.

Index Calculation for Sequence Start Position

The notation $\langle g_1 \rangle, \dots, \langle g_\kappa \rangle$ represents a sequence of $\kappa$ cyclic subgroups. Each term $\langle g_i \rangle$ denotes the cyclic subgroup generated by the element $g_i$. The ellipsis ($\dots$) indicates that the sequence continues from the first element to the $\kappa$-th element.

Sequence of Cyclic Subgroups Notation

The formula $Pr_{\hat{\theta}}(x_{i+1}|x_0, ..., x_i)$ represents the conditional probability of the next element in a sequence, $x_{i+1}$, given all the preceding elements, $x_0, ..., x_i$. The subscript $\hat{\theta}$ indicates that this probability is estimated by a model with parameters $\hat{\theta}$. This is a fundamental concept in autoregressive models, such as language models, which generate sequences one element at a time based on the history of previously generated elements.

Conditional Probability of the Next Element in a Sequence

A large language model is trained by processing a massive collection of text from the internet. In this context, distinguish between the 'data' being used and the 'information' the model is expected to learn. Explain how one serves as the raw material for the other.

Data vs. Information in Model Training

A climate scientist reads ten peer-reviewed articles, synthesizes the data and arguments presented, and develops a new, deeper understanding of the acceleration of glacial melt. This new understanding within the scientist's mind best exemplifies which of the following?

The formula $i - n_c + 1$ is used to calculate the starting index of a context window within a sequence. In this expression, $i$ represents the index of the current or final element of the window, and $n_c$ represents the size or length of the context window. This calculation is fundamental for algorithms that operate on fixed-size segments of sequential data, such as in sliding window attention mechanisms.

Start Index Calculation for a Context Window

Vector prefix notation, commonly denoted as $\mathbf{X}_{\leq i}$, represents the sequence of all vectors from the beginning of a sequence up to and including the $i$-th position. For example, if $\mathbf{X}$ is a sequence of vectors, then $\mathbf{X}_{\leq i} = (\mathbf{x}_1, \mathbf{x}_2, \dots, \mathbf{x}_i)$. This notation is frequently used in autoregressive models to refer to the prefixes of key ($\mathbf{K}_{\leq i}$) and value ($\mathbf{V}_{\leq i}$) sequences that have been processed so far.

Vector Prefix Notation

A user asks a large language model to explain a scientific concept. The model retrieves relevant data, synthesizes it, and generates a paragraph as a response. The user reads this paragraph and gains a new understanding. Which part of this scenario best exemplifies 'information-as-process'?

To simplify mathematical expressions, the complete two-stage process of a text classification model is often represented using the uncluttered shorthand $$ F_{\omega,\hat{\theta}}(\cdot) $$. This compact notation serves as a direct substitute for the expanded formula $$ \mathrm{Classify}_{\omega}(\mathrm{Encode}_{\hat{\theta}}(\cdot)) $$, efficiently representing a function defined by both the classifier's parameters, $$ \omega $$, and the encoder's parameters, $$ \hat{\theta} $$.

Uncluttered Notation for Encoder-Classifier Models

Data encompasses facts, figures, or information gathered for analysis, reference, or computation. It can be qualitative or quantitative and serves as the foundation for reasoning, discussion, or calculation across fields like scientific research, business, and technology. Data exists in diverse forms, including numbers, text, images, or sounds, and is processed to extract meaningful insights. In computing, data is the foundational element; all interactions revolve around reading, modifying, and creating it. Fundamentally, all computer data is stored as uniform sequences of bits, making it inherently similar regardless of its perceived form.

Data (Information)

In reinforcement learning, policy decisions operate under a causality constraint. This means that an action selected at a specific time step, $$t$$, can only impact rewards obtained at or after that time ($$r_t, r_{t+1}, \dots$$). Rewards received prior to time $$t$$ are considered unchangeable or 'fixed' from the perspective of the action at $$t$$.

Causality Constraint in Reinforcement Learning

A draft model is a smaller, computationally less expensive model used to generate candidate sequences or tokens. The probability distribution $$Pr_q(\cdot)$$ represents the likelihood of generating a specific output according to this draft model. This approach is often used in techniques like speculative decoding to accelerate inference in larger, more powerful models by having the large model only verify the draft model's predictions rather than generating tokens from scratch.

Draft Model Probability Distribution ($$Pr_q(\cdot)$$)

This mathematical expression defines $$\mathbf{W}_h$$ as a weight matrix. The notation $$\in \mathbb{R}^{d \times d_h}$$ indicates that this matrix is composed of real numbers and has dimensions of $$d$$ rows and $$d_h$$ columns. In the context of neural networks, such a matrix is typically used as a set of learnable parameters within a linear layer to transform input vectors.

Weight Matrix Definition ($$\mathbf{W}_h \in \mathbb{R}^{d \times d_h}$$)

In mathematical and statistical modeling, the notation $$\hat{y}_{i+t}$$ is used to represent the predicted or estimated value of a variable $$y$$ at a future point in time. The components are: - $$\hat{y}$$: The 'hat' symbol over the variable $$y$$ indicates that it is an estimated or predicted value, not an observed one. - $$i$$: Represents the current index or time step from which the prediction is made. - $$t$$: Represents the number of steps or units of time into the future for which the prediction is made. For example, $$\hat{y}_{i+4}$$ denotes the predicted value of $$y$$ four steps ahead of the current position $$i$$.

Predicted Future Value Notation ($$\hat{y}_{i+t}$$)

A policy, denoted by $$\pi$$, defines an agent's behavior by mapping states to actions. In stochastic policies, $$\pi(a|s)$$ represents the probability of taking action $$a$$ while in state $$s$$. Policies are central to reinforcement learning as they are the component that is optimized to maximize rewards.

Policy in Reinforcement Learning ($$\pi$$)

The notation $$ \langle g_1 \rangle, \dots, \langle g_\kappa \rangle $$ represents a finite sequence of $$ \kappa $$ elements. The elements are denoted by $$ g $$ with subscripts from 1 to $$ \kappa $$. The angle brackets $$ \langle \cdot \rangle $$ enclosing each element can have different meanings depending on the mathematical context, such as denoting an expected value, an inner product, or the subgroup generated by an element.

Learn Before

Related

Learn After