category stringclasses 107
values | title stringlengths 15 179 | question_link stringlengths 59 147 | question_body stringlengths 53 33.8k | answer_html stringlengths 0 28.8k | __index_level_0__ int64 0 1.58k |
|---|---|---|---|---|---|
sequence-to-sequence model | Applying Machine learning in biological data | https://cs.stackexchange.com/questions/63118/applying-machine-learning-in-biological-data | <p>I am trying to solve the following question: Given a text file containing a bunch of biological information, find out the one gene which is {up/down}regulated. Now, for this I have many such (60K) files and have annotated some (1000) of them as to which gene is {up/down}regulated.</p>
<h2>Conditions</h2>
<ul>
<li>Ma... | <p>A simple starting point would be to apply a bag-of-words feature vector and try using a naive Bayes or logistic regression classifier. You'll probably want to apply stemming and lemmatization and remove stop words.</p>
<p>Going based on this one example, determining which gene is regulated looks like it might be p... | 600 |
sequence-to-sequence model | Is there a dual concept to "Turing Complete" in logic? | https://cs.stackexchange.com/questions/78117/is-there-a-dual-concept-to-turing-complete-in-logic | <p>Two computing models can be shown to be co complete if each can encode a universal simulator for the other. Two logics can be shown to be co complete if an encoding of the rules of inferences (and maybe axioms if present) of each be shown to be theorems of the other. In computability this has led to a natural idea... | <p>I'm not sure why you say "true" is ultimately undefinable, as there is a precise definition for what it means for a first order formula to be <a href="https://en.wikipedia.org/wiki/First-order_logic#Evaluation_of_truth_values" rel="nofollow noreferrer">true</a>.</p>
<p>What's unique in the case of computability, is... | 601 |
sequence-to-sequence model | How to compare the efficiency of two encoding schemes or hypothesis languages? | https://cs.stackexchange.com/questions/82080/how-to-compare-the-efficiency-of-two-encoding-schemes-or-hypothesis-languages | <p>My question is pretty basic, I'm looking for a named method if you know one, but also proper terminology, further reading, and anything this reminds you of if you don't. (I'm new to this, don't have the right terminology and just need a starting point so I can help myself.)</p>
<p>I'm trying to interpret the vector... | <p>The answer was just tree depth. What I needed to do was learn about evaluating the complexity of finite automata and how we can use a decision-tree model (<a href="https://en.wikipedia.org/wiki/Decision_tree_model" rel="nofollow noreferrer">decision-tree complexity</a>) to put bounds on the complexity of an automata... | 602 |
sequence-to-sequence model | Alternatives to Sequential Computation | https://cs.stackexchange.com/questions/93714/alternatives-to-sequential-computation | <p>When software boils down to assembly, it is just a sequence of instructions like <a href="http://cs.lmu.edu/~ray/notes/x86assembly/" rel="nofollow noreferrer">this</a>:</p>
<pre><code>mov rax, 1
mov rdi, 1
mov rsi, message
mov rdx, 13
syscall
mov rax, 60
xor rdi, rdi
syscall
</code></pre>
<p>I am not sure exactly ... | 603 | |
recurrent neural networks | Difference between Elman, Hopfield & Hemming Recurrent Neural Networks | https://cs.stackexchange.com/questions/53703/difference-between-elman-hopfield-hemming-recurrent-neural-networks | <p>What is the main difference between Elman, Hopfield & Hemming Recurrent Neural Networks?</p>
<p>Python Neurolab Library examples:</p>
<ul>
<li><a href="https://pythonhosted.org/neurolab/ex_newelm.html" rel="nofollow">Elman Recurrent Neural Network</a></li>
<li><a href="https://pythonhosted.org/neurolab/ex_newh... | 604 | |
recurrent neural networks | Matrix multiplication in recurrent neural networks | https://cs.stackexchange.com/questions/92944/matrix-multiplication-in-recurrent-neural-networks | <p>I was looking at a <a href="http://www.wildml.com/2015/09/recurrent-neural-networks-tutorial-part-2-implementing-a-language-model-rnn-with-python-numpy-and-theano/" rel="nofollow noreferrer">tutorial</a> for recurrent neural networks in Python, and I have a question in regards to multiplying matrices of different si... | <p>Matrix-by-matrix multiplication is very different from scalar-by-scalar. It has no connection to repeated addition, and in fact isn't even commutative: it's entirely possible that $AB \neq BA$. It's only called multiplication because it has some similar properties to repeated addition of scalars.</p>
<p>Matrix mult... | 605 |
recurrent neural networks | Recurrent neural networks (Hopfield-like) with short limit cycles | https://cs.stackexchange.com/questions/87472/recurrent-neural-networks-hopfield-like-with-short-limit-cycles | <p>Standard <a href="http://www.scholarpedia.org/article/Hopfield_network" rel="nofollow noreferrer">Hopfield networks</a> exhibit stable patterns (states) which are attractors of a dynamic system. I wonder how to modify standard Hopfield networks such that they exhibit stable limit <em>cycles</em> as attractors. Since... | 606 | |
recurrent neural networks | Can simple recurrent neural networks be remedied with higher precision floating point numbers? | https://cs.stackexchange.com/questions/83916/can-simple-recurrent-neural-networks-be-remedied-with-higher-precision-floating | <p>I am of the understanding that tradition "simple" recurrent neural networks have the problem of "losing error" after a lot of time steps. But is this some kind of deficiency of the math, or the machines the RNN's are running on? If it's just the machines, couldn't you use something like an arbitrary precision float ... | 607 | |
recurrent neural networks | Difference Between Residual Neural Net and Recurrent Neural Net? | https://cs.stackexchange.com/questions/63541/difference-between-residual-neural-net-and-recurrent-neural-net | <p>What is the difference between a <strong>Residual</strong> Neural Net and a <strong>Recurrent</strong> Neural Net?</p>
<p>As I understand,</p>
<p><a href="https://arxiv.org/pdf/1512.03385v1.pdf" rel="noreferrer">Residual Neural Networks</a> are very deep networks that implement 'shortcut' connections across multip... | <p>The answer is YES, they basically are the same according to this <a href="https://arxiv.org/abs/1604.03640v1" rel="nofollow noreferrer">paper</a> </p>
<p><img src="https://i.sstatic.net/q7JdV.pnghttps://" alt="enter image description here"></p>
<p>The figure above shows how they compared both and how a ResNet can ... | 608 |
recurrent neural networks | How often should I read out information from an echo state recurrent neural network? | https://cs.stackexchange.com/questions/85645/how-often-should-i-read-out-information-from-an-echo-state-recurrent-neural-netw | <p>Recurrent neural networks makes it possible to implement some kind of memory, which can be very useful for a lot of tasks, incl. (but not limited to) robot control, which I am interested in. For example, echo state networks are known to display some kind of dynamical short-term memory, and display a very small searc... | 609 | |
recurrent neural networks | Machine learning for recommendation systems (feed forward and recurrent neural networks) | https://cs.stackexchange.com/questions/88401/machine-learning-for-recommendation-systems-feed-forward-and-recurrent-neural-n | <p>I recently started to learn about machine learning. I have created a feed forward neural network (ffnn) and a recurrent neural network (rnn) to predict user ratings of movies. I am using a subset of 2000 users and their ratings of the "Netflix Prize" dataset.</p>
<p>The ffnn as well as the rrn have an accuracy of ~... | 610 | |
recurrent neural networks | How to calculate activation of hidden nodes in a recurrent neural network? | https://cs.stackexchange.com/questions/45574/how-to-calculate-activation-of-hidden-nodes-in-a-recurrent-neural-network | <p>Usually, when I program recurrent neural networks, I use a loop for each neuron to figure out it's state. What I realized with this is that in this case, no neuron gets any feedback. They just pump their outputs to the next neuron in the cycle. My thoughts on how to counter this is by having neurons in two different... | 611 | |
recurrent neural networks | Reducibility and Artificial Neural Networks | https://cs.stackexchange.com/questions/83047/reducibility-and-artificial-neural-networks | <p>I have read (<a href="https://arxiv.org/pdf/1410.5401.pdf%20(http://Neural%20Turning%20Machines)" rel="nofollow noreferrer">here</a> and <a href="http://research.cs.queensu.ca/~akl/cisc879/papers/SELECTED_PAPERS_FROM_VARIOUS_SOURCES/05070215382317071.pdf" rel="nofollow noreferrer">here</a>
) about the computational ... | <p>Not really. I respect what you're trying to achieve, but I don't think it's possible to achieve what you want, given our current level of knowledge of neural networks.</p>
<p>We already know that convolutional neural networks perform better for some problems, and fully-connected neural networks (what you call MP) ... | 612 |
recurrent neural networks | How does a recurrent connection in a neural network work? | https://cs.stackexchange.com/questions/56805/how-does-a-recurrent-connection-in-a-neural-network-work | <p>I am reading a very <a href="http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf" rel="nofollow noreferrer">interesting paper on genetic algorithms</a> which define neural networks. I am familiar with how a feedforward neural network operates, but then I came across this:</p>
<p><a href="https://i.sstatic.ne... | <p>When a recurrent network is calculated you can imagine the network is 'unrolled' out through time.</p>
<p><a href="https://i.sstatic.net/8J9rZ.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/8J9rZ.png" alt="Unrolling an RNN"></a></p>
<p>When visualized this way, you can see activation and loss can b... | 613 |
recurrent neural networks | DFAs can be encoded as input/output for a neural network? | https://cs.stackexchange.com/questions/60788/dfas-can-be-encoded-as-input-output-for-a-neural-network | <p>I would encode DFAs (Deterministic Finite State automata) as output (or input) of a neural network for a supervised learning; it is well-known [1] that efficacy of neural network training strongly depends on adopted encoding. </p>
<p><em>How can I encode DFAs for a neural network? Are there any literature works?</... | 614 | |
recurrent neural networks | What is the difference of temporal dynamics in RNNs and the NEF | https://cs.stackexchange.com/questions/45700/what-is-the-difference-of-temporal-dynamics-in-rnns-and-the-nef | <p>Both spiking neural networks created with the Neural Engineering Framework (NEF) and Recurrent Neural Networks (RNNs) can be connected recurrently to exhibit neural dynamics. What is the difference between the set of dynamics that they can approximate and/or exhibit?</p>
| <p>There can be a lot of different ways in which recurrent neural networks can be used. RNNs can have any activation function (logistic sigmoid is most commonly used), and they can be multilayer. There are different algorithms which can be used to train them e.g., backpropagaion and different optimization techniques e.... | 615 |
recurrent neural networks | How would a neural network deal with an arbitrary length output? | https://cs.stackexchange.com/questions/2722/how-would-a-neural-network-deal-with-an-arbitrary-length-output | <p>I've been looking into Recurrent Neural Networks, but I don't understand what the architecture of a neural network would look like when the output length is not necessarily fixed. </p>
<p>It seems like most networks I've read descriptions of require the output length to be equal to the input length or at least a fi... | <p>You just add more neurons. You're right that it's often not useful (if you only get 5 bits of information in, it's hard to put 10 bits of information out), but if you want to (e.g. because your output format is less dense), go ahead.</p>
<p>As a trivial example, if you wanted to create an ANN to convert characters ... | 616 |
recurrent neural networks | How can I compare two different neural networks, from a theorical point of view? | https://cs.stackexchange.com/questions/49815/how-can-i-compare-two-different-neural-networks-from-a-theorical-point-of-view | <p>Let's say I have a problem (i.e. Given f(x), find x) and two neural networks(i.e. feedforward and recurrent). I would like to know if one works better than the other one. I could run the twos on a computer, but other programs might interfere and I wouldn't know if the implementations I'm running are really the best ... | <p>Essentially, no. The only way to know which neural network is going to give you better accuracy is to try them on a realistic data set. The theory we have is not well-enough developed to allow us to reliably predict which will do better on a particular data set.</p>
<hr>
<p>A secondary remark. When you remark "... | 617 |
recurrent neural networks | How do RNN's map variable-length sequences to variable-length sequences? | https://cs.stackexchange.com/questions/86510/how-do-rnns-map-variable-length-sequences-to-variable-length-sequences | <p>According to Karpathy's blog "The Unreasonable Effectiveness of Recurrent Neural Networks", recurrent neural networks can map variable-length sequences to variable-length sequences, as shown by the one-to-many, many-to-one, and many-to-many diagrams.</p>
<p>How do RNN's do this mapping of possibly different-length ... | 618 | |
recurrent neural networks | What are the most desirable properties of a neural network? | https://cs.stackexchange.com/questions/51415/what-are-the-most-desirable-properties-of-a-neural-network | <p>I'm trying to compare a custom neural network architecture with other existing ones. I'm quite new to the CS field and I'm looking for desirable properties and/or applications of neural networks(especially recurrent architectures). Are there any?</p>
| 619 | |
recurrent neural networks | What are the limitations of RNNs? | https://cs.stackexchange.com/questions/53552/what-are-the-limitations-of-rnns | <p>For a school project, I'm planning to compare Spiking Neural Networks (SNNs) and Deep Learning recurrent neural networks, such as Long Short Term Memory (LSTMs) networks in learning a time-series. I would like to show some case where SNNs surpass LSTMs. Consequently, what are the limitations of LSTMs? Are they robus... | <p>I finally finished the project. Given really short signals and a really small training set, SNNs (I used <a href="http://minds.jacobs-university.de/sites/default/files/uploads/papers/EchoStatesTechRep.pdf" rel="nofollow noreferrer">Echo State Machines</a> and a <a href="http://ieeexplore.ieee.org/document/7378880/" ... | 620 |
recurrent neural networks | Traveling Salesman Problem with Neural Network | https://cs.stackexchange.com/questions/54200/traveling-salesman-problem-with-neural-network | <p>I was curious if there were any new developments in solving the traveling salesman problem using something like a Hopfield recurrent neural network. I feel like I saw something about recent research getting a breakthrough in this, but I can't find the academic papers anywhere. Is anyone aware of any new, novel dev... | <p><a href="https://towardsdatascience.com/reinforcement-learning-for-combinatorial-optimization-d1402e396e91" rel="noreferrer">This Medium post</a> lists the latest (not a full list of course) studies in the combinatorial optimization domain. All three papers use Deep Reinforcement Learning, which does not need any tr... | 621 |
recurrent neural networks | Do all the cells in a recurrent neural network share learned parameters? | https://cs.stackexchange.com/questions/88891/do-all-the-cells-in-a-recurrent-neural-network-share-learned-parameters | <p>Most descriptions of modern RNNs present a "folded" characterisation, that is to say, a single cell with a loop back to itself transmitting the hidden state from one step to the next. However, in implementations the RNN is computed "unfolded", so a new cell is created for every step of the sequence up to some maximu... | <p>Indeed, the copies of a cell in an unfolded version share their learning parameters.</p>
<p>Why is it done this way? If the sequence processed by the LSTM is always the same lenght, we could conceivably get a better result with different parameters, but there are two key caveats:</p>
<ol>
<li>Shared parameters are... | 622 |
recurrent neural networks | Backpropagation Through Time Recursive Algorithm | https://cs.stackexchange.com/questions/24642/backpropagation-through-time-recursive-algorithm | <p>Would it be plausible to write a recursive version of backpropagation through time for recurrent neural network training? I've only found the iterative version:</p>
<p><a href="http://en.wikipedia.org/wiki/Backpropagation_through_time" rel="nofollow">http://en.wikipedia.org/wiki/Backpropagation_through_time</a></p>... | 623 | |
recurrent neural networks | How can neural networks learn to create new things (sentences for example)? | https://cs.stackexchange.com/questions/44393/how-can-neural-networks-learn-to-create-new-things-sentences-for-example | <p>I have already taken a college course at my uni on machine learning where we implemented all the basic ML programs: linear regression, logistic regression, basic neural network with logistic regression (not perceptron, but we learned the theory of perceptron as a history lesson), k-means, and naive Bayes classifier.... | 624 | |
recurrent neural networks | Name of Generating One Value at a Time in Sequence Generation vs Encoder Decoder | https://cs.stackexchange.com/questions/88620/name-of-generating-one-value-at-a-time-in-sequence-generation-vs-encoder-decoder | <p>a question about machine learning, specifically recurrent models:
For machine translation recurrent neural networks show great promise, common here is an encoder-decoder architecture which takes a source sentence, reads it, and then based on a compressed representation outputs a target sentence.
In opposition to tha... | 625 | |
recurrent neural networks | Choose the best classifier to predict the label of strings of a regular language | https://cs.stackexchange.com/questions/97145/choose-the-best-classifier-to-predict-the-label-of-strings-of-a-regular-language | <p>I have to tackle this problem:
I have some strings that are my training set. These strings belong to a regular language corresponding to a deterministic finite automata (hidden namely I don't now it, neither the language nor the automata). A string is labeled like positive if belong to hidden language and negative o... | <p>My bet would go to a Recurrent Neural Network, as it closely models some (fuzzy, non-discrete) state machine as each character is output. A decent start to read up on RNNs for this purpose is to read the article <a href="http://karpathy.github.io/2015/05/21/rnn-effectiveness/" rel="nofollow noreferrer">The Unreasona... | 626 |
recurrent neural networks | Confused between turing-completeness and universal approximation - are they related? | https://cs.stackexchange.com/questions/68820/confused-between-turing-completeness-and-universal-approximation-are-they-rela | <p>I am trying to de-knot a point of confusion in my mind regarding "turing-completeness" and the "universal approximation theorem". </p>
<p>The context here is deep neural nets: So, consider two types of networks: a recurrent neural net, (RNN), and a feedforward net, say a pure convolutional neural net (CNN). </p>
<... | <p>A CNN can approximate a function on a <em>fixed</em> number of input variables, say $n$ of them. The set of functions on $n$ input variables isn't "Turing-complete". For instance, a boolean function $f:\{0,1\}^n \to \{0,1\}$ is always computable, as it can be computed by a program that just hardcodes the truth-tab... | 627 |
recurrent neural networks | What factors must one consider choosing an NN structure? | https://cs.stackexchange.com/questions/7714/what-factors-must-one-consider-choosing-an-nn-structure | <p>Suppose we have a classification problem and we wish to solve the problem by Neural Network. What factors must one consider choosing an NN structure? e.g Feed Forward, Recurrent and other available structures. </p>
| <p>Here is a list of parameters you should take into consideration (to name some): </p>
<ol>
<li>The learning algorithm (gradient descent is the most explained of them)</li>
<li><p>The number of layers (3,4 layers is usually enough - input, 1 or 2 hidden, output). The output layer depends on your output (e.g., if you ... | 628 |
recurrent neural networks | Language grammar correction with supervised learning | https://cs.stackexchange.com/questions/48710/language-grammar-correction-with-supervised-learning | <p>I want to work on automatic grammar correction using machine learning (possibly using recurrent or deep neural networks). The algorithm will be supplied with both corrected and initial documents for supervised learning.</p>
<p>I am now looking for some survey or research papers to start with. I have searched and do... | <p>The following paper from 2011 proposes a nice approach for using language modeling to do grammar correction, as well as an evaluation framework. </p>
<ul>
<li>Park and Levy, <em>Automated whole sentence grammar correction using a noisy channel model</em>. In <em>Proc. 49th Human Language Technologies</em>, volume 1... | 629 |
recurrent neural networks | How long can the short memory last in the RNN? | https://cs.stackexchange.com/questions/142325/how-long-can-the-short-memory-last-in-the-rnn | <p>For a recurrent neural network, the LSTM was a model of how the network worked. However, consider the case where an input was a long paragraph or even an article.
<span class="math-container">$$c_1c_2...c_n$$</span>
where <span class="math-container">$c_i$</span> were some characters. The LSTM would work as expected... | 630 | |
recurrent neural networks | Is there something as good as a GRU or LSTM but simpler? | https://cs.stackexchange.com/questions/83939/is-there-something-as-good-as-a-gru-or-lstm-but-simpler | <p>I was just reading this paper: <a href="https://arxiv.org/pdf/1701.05923.pdf" rel="nofollow noreferrer">Gate-Variants of Gated Recurrent Unit (GRU) Neural
Networks Rahul Dey and Fathi M. Salem</a></p>
<p>It seems to me that perhaps the architecture of LSTMs and GRUs are overly complicated. And that the same problem... | 631 | |
recurrent neural networks | What is the State of The Art of Writer AIs (Deep Learning)? | https://cs.stackexchange.com/questions/95679/what-is-the-state-of-the-art-of-writer-ais-deep-learning | <blockquote>
<p>Does anyone know if Deep Learning Bots can already, for example, train
on many books of an author and output a similar but new book?</p>
</blockquote>
<p>I've been wanting to get into ML for quite a while but was lacking a project to use as an incentive to keep learning, and this specific AI has ca... | <p>Researchers are trying it out, but RNNs learn character-by-character (sequences of characters), so it is difficult to get something that resembles a story plot, as a whole. <a href="http://karpathy.github.io/2015/05/21/rnn-effectiveness/" rel="nofollow noreferrer">This link</a> by a Stanford researcher explains the ... | 632 |
recurrent neural networks | What are the inputs to an LSTM for Slot Filling Task | https://cs.stackexchange.com/questions/71032/what-are-the-inputs-to-an-lstm-for-slot-filling-task | <p>I am confused on the inputs of a Long-Short Term Memory (LSTM) for the slot filling task in Spoken Language Understanding. </p>
<p>Before I worked on this, I implemented a language model with a Recurrent Neural Network (RNN) and then with a LSTM. The input to the RNN and LSTM language models was a one hot vector, w... | 633 | |
recurrent neural networks | RNN learning an iterative algorithm | https://cs.stackexchange.com/questions/83875/rnn-learning-an-iterative-algorithm | <p>How do I solve the following problem with a recurrent neural network (RNN)? What architecture should I use for the (conv)-RNN? </p>
<blockquote>
<p>Let $s \in \mathbb{R}^N$ be a musical signal. We corrupt it with some white/pink noise $\omega$ to obtain $x= s+\omega$.
We then create a conv-RNN with $N$ input a... | 634 | |
long short-term memory | Why we still need Short Term Memory if Long Term Memory can save temporary data? | https://cs.stackexchange.com/questions/135237/why-we-still-need-short-term-memory-if-long-term-memory-can-save-temporary-data | <p>If RAM is a short term memory and SSD is a long term memory, why don't microarchitecture of computer nowadays use SSD or another long term memory for saving temporary data like hidden variable for programming?</p>
<p>If it's about speed, then SSD can improve its speed, is it possible that SSD will become faster than... | <p>There's two simple reasons, one fundamental and one related to our current technology. First the technical one: volatile storage is (generally) faster than non-volatile storage. It has fewer requirements - it only needs to store the data for a short while until it gets refreshed, so it's not a surprise that it often... | 635 |
long short-term memory | How long can the short memory last in the RNN? | https://cs.stackexchange.com/questions/142325/how-long-can-the-short-memory-last-in-the-rnn | <p>For a recurrent neural network, the LSTM was a model of how the network worked. However, consider the case where an input was a long paragraph or even an article.
<span class="math-container">$$c_1c_2...c_n$$</span>
where <span class="math-container">$c_i$</span> were some characters. The LSTM would work as expected... | 636 | |
long short-term memory | What are the limitations of RNNs? | https://cs.stackexchange.com/questions/53552/what-are-the-limitations-of-rnns | <p>For a school project, I'm planning to compare Spiking Neural Networks (SNNs) and Deep Learning recurrent neural networks, such as Long Short Term Memory (LSTMs) networks in learning a time-series. I would like to show some case where SNNs surpass LSTMs. Consequently, what are the limitations of LSTMs? Are they robus... | <p>I finally finished the project. Given really short signals and a really small training set, SNNs (I used <a href="http://minds.jacobs-university.de/sites/default/files/uploads/papers/EchoStatesTechRep.pdf" rel="nofollow noreferrer">Echo State Machines</a> and a <a href="http://ieeexplore.ieee.org/document/7378880/" ... | 637 |
long short-term memory | Which queue does the long-term scheduler maintain? | https://cs.stackexchange.com/questions/1106/which-queue-does-the-long-term-scheduler-maintain | <p>There are different queues of processes (in an operating system):</p>
<p><em>Job Queue:</em> Each new process goes into the job queue. Processes in the job queue reside on mass storage and await the allocation of main memory.</p>
<p><em>Ready Queue:</em> The set of all processes that are in main memory and are wai... | <p>I found an appropriate answer. I was asking about the job queue (which I already described). The diagram included in this answer comes from a <a href="https://docs.google.com/viewer?a=v&q=cache:7Rv2SA2-LfgJ:www.cs.gsu.edu/~cscbecx/csc4320%2520Chapter%25203.ppt%20&hl=en&gl=uk&pid=bl&srcid=ADGEESiZ... | 638 |
long short-term memory | What are the inputs to an LSTM for Slot Filling Task | https://cs.stackexchange.com/questions/71032/what-are-the-inputs-to-an-lstm-for-slot-filling-task | <p>I am confused on the inputs of a Long-Short Term Memory (LSTM) for the slot filling task in Spoken Language Understanding. </p>
<p>Before I worked on this, I implemented a language model with a Recurrent Neural Network (RNN) and then with a LSTM. The input to the RNN and LSTM language models was a one hot vector, w... | 639 | |
long short-term memory | How does the forget layer of an LSTM work? | https://cs.stackexchange.com/questions/118865/how-does-the-forget-layer-of-an-lstm-work | <p>Can someone explain the mathematical intuition behind the forget layer of an LSTM?</p>
<p>So as far as I understand it, the cell state is essentially long term memory embedding (correct me if I'm wrong), but I'm also assuming it's a matrix. Then the forget vector is calculated by concatenating the previous hidden s... | <p>Think of it like this: The cell state <span class="math-container">$h_t$</span> is a vector. The forget vector <span class="math-container">$f_t$</span> is used to choose which parts of the cell state to "forget". We update the hidden state with something like <span class="math-container">$c_t = f_t \circ c_{t-1}$... | 640 |
long short-term memory | Intuitive description for training of LSTM (with forget gate/peephole)? | https://cs.stackexchange.com/questions/12871/intuitive-description-for-training-of-lstm-with-forget-gate-peephole | <p>I am a CS undergraduate (but I don't know much about AI though, did not take any courses on it, and definitely nothing about NN until recently) who is about to do a school project in AI, so I pick a topics regarding grammar induction (of context-free language and perhaps some subset of context-sensitive language) us... | <p>LSTM is designed to process a stream of data chunks (each chunk being the set of inputs for the network at this point in time) that arrive over time and observe features occurring in the data and yield output accordingly. The time lag (delay) between the occurrence of features to recognize may vary and may be prolo... | 641 |
long short-term memory | Neural network: noisy temporal sequence converter (transducer?producer?) on demand? | https://cs.stackexchange.com/questions/22666/neural-network-noisy-temporal-sequence-converter-transducerproducer-on-dema | <p>I start to suspect this problem is very hard now that I cannot find a single relevant literature on the subject, but it's too late to change the class project topics now, so I hope any pointers to a solution. Please pardon the somewhat artificial scenerio of this question, but here goes:</p>
<p>Technical version: <... | <p>I unfortunately know very little of neural network. The closest thing
that your project reminds me of is speech recognition, and I would
look at that literature. I am thinking of the first stage of speech
recognition, when the sound stream is transformed into a word lattice
(or a word stream, if you keep only the m... | 642 |
semantic similarity | Semantically Compare Programs by Similarity? | https://cs.stackexchange.com/questions/162563/semantically-compare-programs-by-similarity | <p>In NLP, it's common to study the semantic similarity between pieces of text, which can be calculated in a number of ways. Are there any tools, methods, algorithms or processes that can be used to compare the semantic similarity of programs? That is, compare if two programs produce a similar output given similar inpu... | 643 | |
semantic similarity | Semantic similarity in text | https://cs.stackexchange.com/questions/2955/semantic-similarity-in-text | <p>Is there a relatively simple way of telling if two pieces of text are semantically similar?</p>
<p>Some assumptions that are valid:</p>
<ul>
<li>It is all english</li>
<li>I have a list of all the <em>important</em> nouns</li>
</ul>
<p>Are there any strategies that I should pursue? Looking for something that is r... | <p>Here's a simple technique.</p>
<p>Train an LDA using something like <a href="http://mallet.cs.umass.edu" rel="nofollow">MALLET</a> over your collection of texts. For each pair of documents you want to compare, obtain the topic distributions and compute the <a href="http://en.wikipedia.org/wiki/Hellinger_distance" r... | 644 |
semantic similarity | How to determine agreement between two sentences? | https://cs.stackexchange.com/questions/56828/how-to-determine-agreement-between-two-sentences | <p>A common Natural Language Processing (NLP) task is to determine semantic similarity between two sentences. Has the question of agreement/disagreement between two sentences been covered in NLP or other literature? I tried searching on Google Scholar but didn't get any relevant results.</p>
| <p>I would propose to do some researching in the field of <strong>Stance Classification</strong>. Given a target claim or argument we can classify whether a number of sentences are in favor, against or neither of that claim. So an idea is to extract the topic of those sentences classify whether they agree or disagree w... | 645 |
semantic similarity | Representing abstract syntax tree as a graph | https://cs.stackexchange.com/questions/140149/representing-abstract-syntax-tree-as-a-graph | <p>Does it make sense to represent an AST as a graph? How can one achieve a mapping between ASTs and graphs that preserves both semantic and syntactic properties of source code?</p>
<p>The goal and application of such a transformation would be to use graph neural networks and other deep "graph" learning techn... | <p>Every tree is itself a graph, so of course an AST is a graph -- no mapping is needed, it is already a graph. I don't see any way that this is useful in practice, though.</p>
<p>Rather than trying to convert to a graph and then use graph neural networks, I suggest using a more direct approach: e.g., using a neural n... | 646 |
semantic similarity | Two classes of documents. Find weighted relations between them | https://cs.stackexchange.com/questions/28133/two-classes-of-documents-find-weighted-relations-between-them | <p>I have an NLP problem and a potential solution, but I’m a bit green here, so I’m looking for some validation or alternative suggestions.</p>
<h1>Background</h1>
<p>I have two types of documents: one is a set of short statements of an organization's goals and objectives (“Goals”, from here on. ~500 docs, ~100 words... | 647 | |
semantic similarity | Constraint based analysis: understanding the program $[[ \text{fn} \ x => [x]^1]^2 [ \text{fn} \ y => [y]^3]^4]^5$ | https://cs.stackexchange.com/questions/132947/constraint-based-analysis-understanding-the-program-textfn-x-x1 | <p>I am currently studying the textbook <a href="http://faculty.sist.shanghaitech.edu.cn/faculty/songfu/cav/PPA.pdf" rel="nofollow noreferrer"><em>Principles of Program Analysis</em> by Flemming Nielson, Hanne R. Nielson, and Chris Hankin</a>. Chapter <strong>1.4 Constraint Based Analysis</strong> says the following:</... | 648 | |
question answering | More Information about the Question Answering System called LUKE | https://cs.stackexchange.com/questions/125466/more-information-about-the-question-answering-system-called-luke | <p>LUKE is a new state-of-art in question answering system and after googled keywords LUKE Studio Ousia NAIST and RIKEN AIP (I suppose LUKE is a colaboration between several research centers) I couldn't find any information.</p>
<p>LUKE is mentioned in the following pages:</p>
<p><a href="https://paperswithcode.com/s... | <p>Check this out. This might be the paper</p>
<p><a href="https://www.researchgate.net/project/LUKE-Project" rel="nofollow noreferrer">https://www.researchgate.net/project/LUKE-Project</a></p>
<p><a href="https://www.researchgate.net/publication/340461536_Global_Entity_Disambiguation_with_Pretrained_Contextualized_E... | 649 |
question answering | Combining Ontology and Relational Databases in Question Answering system | https://cs.stackexchange.com/questions/74514/combining-ontology-and-relational-databases-in-question-answering-system | <p>I'm introducing to the Natural Language Processing field and it's application. I'm planning to build a question answering system for a project, but some approaches are making me a bit confuse about the use of ontologies and it's application on the architecture of the system. I understand that an Ontology in definiti... | 650 | |
question answering | What program will derive the underlying algorithm in these question-answer pairs (updated)? | https://cs.stackexchange.com/questions/19663/what-program-will-derive-the-underlying-algorithm-in-these-question-answer-pairs | <p>Given this set of question-answer pairs, what program will derive the underlying algorithm and provide the correct answer for any question of the same format.</p>
<p><strong>Question-Answer Pairs (training set):</strong></p>
<pre><code>B:BA
BA:BB
BB:BAA
BAA:BAB
BAB:BBA
BBA:BBB
BBB:BAAA
BAAA:BAAB
BAAB:BABA
</code><... | <p>The same answers you got <a href="https://cs.stackexchange.com/a/19640/755">the last time you asked this question</a> apply. There are infinitely many possible mappings $\{A,B\}^* \to \{A,B\}^*$ and none is preferable to any other.</p>
<p>Let's try to formalize your problem more clearly. I suspect you want an alg... | 651 |
question answering | Answering questions about the recurrence of certain aspects of an algorithm | https://cs.stackexchange.com/questions/97901/answering-questions-about-the-recurrence-of-certain-aspects-of-an-algorithm | <p>I am thoroughly confused by a problem that was brought up in class:</p>
<p>Given the following pseudocode for a function RANDOM which generates a random number based off of recursion: </p>
<pre><code>function RANDOM(n)
1. if n = 1 then
1.1 return 1
1.2 else
2.1 assign x = 0 with probability 1/2, or
2.2 ... | <p>Firstly, there is one minor typo in the question. The "<span class="math-container">$T(n) =\frac 32 * T(n-1) + 1$</span>" should be "<span class="math-container">$T(n) =\frac 32 * (T(n-1) + 1)$</span>" since this equality is said to be obtained by simple algebra from the equality above it. However, this typo does no... | 652 |
question answering | Questions about an answer to a pumping lemma question for CFLs | https://cs.stackexchange.com/questions/11358/questions-about-an-answer-to-a-pumping-lemma-question-for-cfls | <p>In <a href="https://cs.stackexchange.com/a/7741/4689">the answer to this question</a>, I'm not understanding how the string is derived for a given $l$.</p>
<p>For example,</p>
<blockquote>
<p>Case 1: $vx = a^i$ where $i > 0$. Choose $l = 2$ to get $a^{n+i} b^{n+1} c^{n+1} d^n \notin L$.</p>
</blockquote>
<p>... | <p>The essential idea is that pumping lemma tells you about string $uv^lwx^ly$ with $l \geq 0$. That is, you can "pump" to $uwy$, if $l = 0$, that way shortening the initial string.</p>
<p>The answer considers the string $a^n b^{n+1} c^{n+1} d^n$. Removing a single $b$ or inserting a single $a$ would move the string o... | 653 |
question answering | Please check my answer to a pseudocode CASE statement question | https://cs.stackexchange.com/questions/119541/please-check-my-answer-to-a-pseudocode-case-statement-question | <p>This is a pseudocode question in my IGCSE CompSci textbook:</p>
<blockquote>
<p>Use a <code>CASE</code> statement to display the day of the week if the variable <code>DAY</code> has the value 1 to 7 and an error otherwise.</p>
</blockquote>
<p>This is my answer to it:</p>
<pre><code>CASE Day OF
1 : OUTPUT "... | <p>This problem is about switch-case statements. So, if you can do a pseudo-code of such a statement with the case being a DAY variable and the steps are clear, that would be correct.
So, your answer is totally correct and the steps are clear. There's no one way of doing pseudo code.</p>
<pre><code>switch(DAY)
case... | 654 |
question answering | API to retrieve answers for general questions | https://cs.stackexchange.com/questions/65785/api-to-retrieve-answers-for-general-questions | <p>I was looking for a service (with API) where I can ask it a general question (aka, when was Einstein born?) and retrieve an answer from the Web.</p>
<p>Is there any available service to do that? Have tried Watson services but didn't work as expected.</p>
<p>Thanks,</p>
| 655 | |
question answering | Question about an answer related to designing an ASM for a sequence detector | https://cs.stackexchange.com/questions/140996/question-about-an-answer-related-to-designing-an-asm-for-a-sequence-detector | <p>The question says:</p>
<blockquote>
<p>Design a sequence detector that searches for a series of binary inputs to satisfy
the pattern 01[0*]1, where [0*] is any number of consecutive zeroes. The
output (Z) should become true every time the sequence is found.</p>
</blockquote>
<p>The answer to this example in the docu... | <p>Yup. It looks like this accepts 0011, and it shouldn't, so it looks to me like the automaton is buggy.</p>
| 656 |
question answering | How can I optimize the systems in the paper "Ensembling Ten Math Information Retrieval Systems" | https://cs.stackexchange.com/questions/144264/how-can-i-optimize-the-systems-in-the-paper-ensembling-ten-math-information-ret | <p>My question is about the paper <a href="http://ceur-ws.org/Vol-2936/paper-06.pdf" rel="nofollow noreferrer">Ensembling Ten Math Information Retrieval Systems</a>.</p>
<p>I already know the algorithms in the paper can answer questions only using dot products (look the <a href="https://cs.stackexchange.com/questions/1... | <p>Here are two major ways in which you can make the ten math information retrieval systems in <a href="http://ceur-ws.org/Vol-2936/paper-06.pdf" rel="nofollow noreferrer">the MIRMU and MSM at ARQMath 2021 paper</a> (and many other experimental retrieval systems) faster:</p>
<ol>
<li>using appropriate data structures f... | 657 |
question answering | Does CompuBERT suffer from the curse of dimensionality? | https://cs.stackexchange.com/questions/144246/does-compubert-suffer-from-the-curse-of-dimensionality | <p>This question is about <a href="http://ceur-ws.org/Vol-2936/paper-06.pdf" rel="nofollow noreferrer">CompuBERT</a> (<a href="https://drive.google.com/drive/folders/1bxYwWzDX3z81S4TwUaTvqZBHtiMOngez" rel="nofollow noreferrer">new implementation</a>).</p>
<p>I have read textual data have high dimensionality so I would ... | <p><a href="https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations#Matrix_algebra" rel="nofollow noreferrer">The time complexity of matrix multiplication</a> depends on both dimensions <span class="math-container">$m$</span> (the number of documents) and <span class="math-container">$n$</span... | 658 |
question answering | Is there a publicly available informer tagger or dataset? | https://cs.stackexchange.com/questions/67164/is-there-a-publicly-available-informer-tagger-or-dataset | <p>I am working on a question answering system. I've learned that informer spans are valuable features for question classification. However from what I've read I wasn't able to find any publicly available dataset for this task, or a trained tagger. Is there any? People seem to just hand-label their dataset.</p>
<p>If ... | 659 | |
question answering | How can I make inference in CompuBERT? | https://cs.stackexchange.com/questions/139361/how-can-i-make-inference-in-compubert | <p>My question is about the paper <a href="http://ceur-ws.org/Vol-2696/paper_235.pdf" rel="nofollow noreferrer">Three is Better than One Ensembling Math Information Retrieval Systems</a> (a system used for math information retrieval - both for finding answers and formula search)(code on <a href="https://github.com/MIR-... | <p>CompuBERT's objective is to create representations, i.e. embeddings <span class="math-container">$E$</span> such that a distance of a question to a relevant answer is minimal, while its distance to an irrelevant question is maximal.</p>
<p>On indexing (see in <a href="https://github.com/MIR-MU/CompuBERT/blob/c535ff1... | 660 |
question answering | Dynamic programming: optimal order to answer questions to score the maximum expected marks | https://cs.stackexchange.com/questions/157814/dynamic-programming-optimal-order-to-answer-questions-to-score-the-maximum-expe | <p>You have <span class="math-container">$n$</span> questions in an exam. Question <span class="math-container">$i$</span> is answered correctly with probability <span class="math-container">$p_i > 0$</span>. If question <span class="math-container">$i$</span> is answered correctly, you get <span class="math-contain... | <p>First, if any <span class="math-container">$p_i=0$</span>, then immediately throw it away since you're guaranteed to lose. If any probability is <span class="math-container">$1$</span> then immediately ask it! (after all why <em>risk</em> not getting the reward when you're guaranteed to get it!). So I'll assume we'r... | 661 |
question answering | Does anyone know the answer the following questions on converting logical - physical addresses | https://cs.stackexchange.com/questions/123872/does-anyone-know-the-answer-the-following-questions-on-converting-logical-phys | <p>Due to the unforeseen pandemic, I am unable to speak to my tutor about the following question. I have emailed him, but I have not had an answer for weeks. Can someone please enlighten me. </p>
<p>Image and question to be answered below. Please provide an explanation, as I am struggling to find an answer:</p>
<p><a... | 662 | |
question answering | Is it possible to query a Knowledge Graph using only Matrix operations? | https://cs.stackexchange.com/questions/116627/is-it-possible-to-query-a-knowledge-graph-using-only-matrix-operations | <p>I am interested in formulating a knowledge graph query in a matrix multiplication/dot product/inner product.</p>
<p>I have found by chance the paper <a href="http://ws.nju.edu.cn/courses/ke/reading/1_variational.pdf" rel="nofollow noreferrer">Variational Reasoning for Question Answering with Knowledge Graph</a> whi... | 663 | |
question answering | Creating a database of math questions and of answers and a front end for them | https://cs.stackexchange.com/questions/142931/creating-a-database-of-math-questions-and-of-answers-and-a-front-end-for-them | <p>Need some guidance on where to begin. I am just learning python if it has any bearing.</p>
<p>I want to create a page on my site where users log in, choose multiple topics from a list, choose between levels of difficulty, choose whether or not to be timed, and then be presented with random multiple choice questions... | 664 | |
question answering | What questions can denotational semantics answer that operational semantics can't? | https://cs.stackexchange.com/questions/63874/what-questions-can-denotational-semantics-answer-that-operational-semantics-can | <p>I am familiar with operational semantics (both small-step and big-step) for defining programming languages. I'm interested in learning denotational semantics as well, but I'm not sure if it will be worth the effort. Will I just be learning the same material from a different point of view, or are there insights I can... | <p>There is no real agreement what characterises denotational semantics (see also <a href="https://cstheory.stackexchange.com/questions/3577/what-constitutes-denotational-semantics">this</a> article), except that it must be <strong>compositional</strong>. That means that if $\newcommand{\SEMB}[1]{\lbrack\!\lbrack #1 \r... | 665 |
question answering | Is it possible to run the transformer (performer) SLiM without using GPUs? | https://cs.stackexchange.com/questions/144309/is-it-possible-to-run-the-transformer-performer-slim-without-using-gpus | <p>This question is about the article <a href="https://arxiv.org/pdf/2012.11346.pdf" rel="nofollow noreferrer">Sub-Linear Memory How to Make Performers SLiM</a>.</p>
<p>I googled for the fastest transformer and I think almost surely I found. It is called SLiM.</p>
<p>The problem is the authors use only GPUs and I don't... | 666 | |
question answering | Help interpreting this deadlock question | https://cs.stackexchange.com/questions/45764/help-interpreting-this-deadlock-question | <p>I have this assignment question but I am a bit unsure how to go about answering it. The question is as follows and accompanied by the image below: </p>
<p>Three processes are competing for six resources labelled A to F as shown
below.</p>
<p><a href="https://i.sstatic.net/8ilRU.jpg" rel="nofollow noreferrer"><img ... | <p>Here is one bad scenario:</p>
<ol>
<li>P0 obtains A and B.</li>
<li>P1 obtains D and E.</li>
<li>P2 obtains C and F.</li>
</ol>
<p>At this point, we have reached deadlock, since P0 is waiting for P2 to release C, P1 is waiting for P0 to release B, and P2 is waiting P1 to release D.</p>
| 667 |
question answering | How to get the quick answer to the "Is there AT LEAST ONE subset that contains all given elements?" question if the set of subsets is very large? | https://cs.stackexchange.com/questions/70405/how-to-get-the-quick-answer-to-the-is-there-at-least-one-subset-that-contains-a | <p>I have a very large amount of objects that look like this: </p>
<pre><code>DataDict = {
id1: {"a": true, "b": true, "bc": true, "hgf": true},
id2: {"bcwe": true, "nKNNn": true, "mjj": true, "AAt": true},
id3: {"h": true, "a": true, "mjj": true, "ABwAU": true},
id4: {"wvzy": true, "zzba": true, "abc": true, "a": tr... | <p>It's possible to answer such queries in time $O(M^{1 - S/N})$, where $S$ is the size of the subset in the query, using a data structure from Ron Rivest:</p>
<p><a href="https://people.csail.mit.edu/rivest/pubs/Riv76b.pdf" rel="nofollow noreferrer">Partial-Match Retrieval Algorithms</a>. Ronald L. Rivest. SIAM Jou... | 668 |
question answering | Relationship of algorithm complexity and automata class | https://cs.stackexchange.com/questions/52748/relationship-of-algorithm-complexity-and-automata-class | <p>I have been unable to find a graph depicting or text answering the following question: Is there a direct relationship between the complexity of an algorithm (such as best / worst case of quick sort), and class of automata that can implement the algorithm. For example is there a range of complexity push down automata... | <p>Yes, there are relationships in many cases!</p>
<p>For example, it is known that any language which is accepted by reversal-bounded counter machines are in $P$ (see <a href="http://www.sciencedirect.com/science/article/pii/0022000081900283">here</a>).</p>
<p>Similarly, we know that all regular languages are in $P$... | 669 |
question answering | Which of the following languages is accepted by this Pushdown Automaton? | https://cs.stackexchange.com/questions/74140/which-of-the-following-languages-is-accepted-by-this-pushdown-automaton | <p>This is a question from a past paper. I am struggling to get my head around the concept of a PDA. I understand that it is a Finite Automaton with a stack but am stuck as far as answering questions like this one. Thanks. </p>
<p><a href="https://i.sstatic.net/ONLzK.jpg" rel="nofollow noreferrer"><img src="https://i.... | <p>I think the answer is a, $\{a^n b^{2n} | n > 0\}$.</p>
<p>First, the machine pushes $a$'s onto the stack until the first $b$. Then, for every two $b$'s in the string, it pops off one $a$. Then, if the machine is at the end of the string and the stack is empty, it accepts.</p>
<p>If the stack of $a$'s runs out w... | 670 |
question answering | Show that the collection of Turing-recognizable languages is closed under homomorphism | https://cs.stackexchange.com/questions/89151/show-that-the-collection-of-turing-recognizable-languages-is-closed-under-homomo | <p>I have seen this question here,
<a href="https://cs.stackexchange.com/questions/87475/closure-of-turing-recognizable-languages-under-homomorphism">Closure of Turing-recognizable languages under homomorphism</a>
But actually this question answers the question of "What is the relation between homomorphism and concaten... | <p>The proof is posted by Anwar Saiah on <a href="https://cs.stackexchange.com/q/87709/83244">this post</a>. I quote it here (with its formatting improved).</p>
<blockquote>
<p>Given a language <span class="math-container">$L$</span> that is Turing recognizable and a TM <span class="math-container">$M$</span> that reco... | 671 |
question answering | Recursive language with non-recursive subsets | https://cs.stackexchange.com/questions/17860/recursive-language-with-non-recursive-subsets | <p>I have a professor who is really poor at explaining the material, which is what makes answering his questions very hard. Here is the question:</p>
<blockquote>
<p>Recursive language with non-recursive subsets. Does one exist?</p>
</blockquote>
<p>I'm sure it is a very simple and easy answer but I can't figure it... | <p>Hint. Take a very big recursive language over any alphabet you like. Verrrry big. Something so big it has all kinds of subsets.</p>
| 672 |
question answering | tcp congestion avoidance | https://cs.stackexchange.com/questions/124460/tcp-congestion-avoidance | <p>I came across this question:</p>
<pre><code>At the beginning of transmission t, a TCP connection in congestion avoidance mode
has a congestion window w = 60 segments.Packet loss is observed during transmission
rounds t, t+10, and t+20 by getting multiple ACKs. What is the congestion window
at the end of round t, t... | <p>When we are in AC mode every rtt(round trip time) the congestion window increase by 1(MSS).
Here our current congestion window(cw) is 60 and we know that during transmission round t we get 3 duplicate acks-so our window is now 30MSS,now we also know that from t to t+1 for instance our window increase by 1,so from t ... | 673 |
question answering | Third Normal Form and Boyce Code normal form | https://cs.stackexchange.com/questions/119207/third-normal-form-and-boyce-code-normal-form | <p>I know that this is not a question answer site but for sake of explaining my doubt I have to post the entire question..</p>
<blockquote>
<p>Consider the following statements.</p>
<pre><code>If relation R is in 3NF and every key is simple, then R is in BCNF
If relation R is in 3NF and R has only one key, then R i... | <blockquote>
<p><span class="math-container">$S_1:$</span> If relation R is in 3NF and every key is simple, then R is in
BCNF.</p>
<p><span class="math-container">$S_2:$</span> If relation R is in 3NF and R has only one key, then R is in BCNF</p>
</blockquote>
<p>Both statements are correct.</p>
<p><strong>Your counter... | 674 |
question answering | CPU and GPU differences | https://cs.stackexchange.com/questions/56082/cpu-and-gpu-differences | <p>What is the difference between a single processing unit of CPU and single processing unit of GPU? <br>
Most places I've come along on the internet cover the high level differences between the two. I want to know what instructions can each perform and how fast are they and how are these processing units integrated in... | <p>This are not Real numbers as $\mathbb{R}$, but at this point - CPU has double precision floating point numbers, GPU very low number of units processing them, floats on GPU are <em>halfs</em>.<br>
This is due to graphics (this was the main goal before parallel processing), where results are rounded to display, so spe... | 675 |
question answering | How to find the intersection of two FAs and then check if two FAs are equal? | https://cs.stackexchange.com/questions/154969/how-to-find-the-intersection-of-two-fas-and-then-check-if-two-fas-are-equal | <p><a href="https://i.sstatic.net/tAaWw.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/tAaWw.png" alt="Two FAs" /></a></p>
<p>I am still quite confused on how to properly handle in answering the <code>intersection and equality of two FAs</code> in terms of table form and manipulating its transformation.... | 676 | |
question answering | Big-O notation based on runtime | https://cs.stackexchange.com/questions/76283/big-o-notation-based-on-runtime | <p>I am having a hard time determining the Big-O notation based on the runtime of the algorithm. I would really appreciate it if any one of you could give me some hint/ or tips in answering the question. </p>
<p><a href="https://i.sstatic.net/AaXOM.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/AaXOM.p... | <p>Taking into account both of the comments above, you can improve a pretty good answer for your problem by taking different orders of magnitude and then using log-logplot in order to get a polinomal for which your data converges (for instance you can use Lagrange's interpolation theorem result) so you can determine a ... | 677 |
question answering | Given a complete, weighted and undirected graph $G$, complexity of finding a path with a specific cost | https://cs.stackexchange.com/questions/24231/given-a-complete-weighted-and-undirected-graph-g-complexity-of-finding-a-pat | <p>Given a fully connected graph $G$, suppose that we are searching for a simple path $P$ with a specific cost $c$. </p>
<p>Is answering to that problem <em>yes</em> or <em>no</em> equivalent to subset-sum problem?
What would be the complexity of finding such path?</p>
<p>I have made a reduction from subset-sum probl... | <p>Given an instance $\langle \{s_1,\ldots,s_n\}, T \rangle$ of subset sum, construct the following weighted graph. The vertices are
$$ v_0,v_1,\ldots,v_n,u_1,\ldots,u_n. $$
Connect $v_{i-1}$ and $v_i$ with an edge of weight $s_i$. Connect $v_{i-1}$ to $v_i$ via $u_i$ (i.e., add the edges $\{v_{i-1},u_i\},\{u_i,v_i\}$)... | 678 |
question answering | If we have f(n) ∈ O(h(n)) and g(n) ∈ Ω(h(n)), does that mean that f(n) + g(n) ∈ Θ(h(n))? | https://cs.stackexchange.com/questions/159225/if-we-have-fn-%e2%88%88-ohn-and-gn-%e2%88%88-%e2%84%a6hn-does-that-mean-that-fn-gn-%e2%88%88 | <p>It is quite easy to prove that f(n) + g(n) ∈ Ω(h(n)), but I am having trouble with proving/disproving that f(n) + g(n) ∈ O(h(n)).</p>
<p>Someone suggested that <a href="https://cs.stackexchange.com/questions/158890/if-f-oh-and-g-%CE%A9h-then-fg-is">this question</a> answers mine, which it doesn't. As I've written ab... | <p>"We know nothing about the upper bound" is a good intuition but it is not a formal proof that you can't hope to show <span class="math-container">$f(n) + g(n) \in O(h(n))$</span> if your only assumptions are <span class="math-container">$f(n) \in O(h(n))$</span> and <span class="math-container">$g(n) \in \... | 679 |
question answering | How do I show that an equivalence class of a language containing an empty string is infinite | https://cs.stackexchange.com/questions/55203/how-do-i-show-that-an-equivalence-class-of-a-language-containing-an-empty-string | <p>The question is as follows: </p>
<blockquote>
<p>Let $L$ be a language (not necessarily regular) over an alphabet. Show
that if the equivalence class containing the empty string $[ \epsilon ]$
is not $\{ \epsilon \}$, then it is infinite.</p>
</blockquote>
<p>How do I go about answering this? Would I need to... | <p>Let $A$ be the alphabet. I suppose that the equivalence you are referring to is the equivalence $\sim$ defined on $A^*$ by $u \sim v$ if and only if, for all $x \in A^*$,
$$
ux \in L \Leftrightarrow vx \in L
$$
Now suppose there is a word $u \in A^+$ such that $u \sim \varepsilon$. Then by definition, $x \in L$ i... | 680 |
question answering | Determining Big O | https://cs.stackexchange.com/questions/28461/determining-big-o | <pre><code> i<--2
while (i<n)
someWork (...)
i <-- power (i,2)
done
</code></pre>
<blockquote>
<p>Given that someWork(...) is an O(n) algorithm, what is the worst case
time complexity?</p>
</blockquote>
<p>I've found this question answered on this site with the solution of O(n log ... | <p>You're missing a very crucial component of Big-Oh analysis. That question is: given some number <code>n</code> and some code <code>p</code> how does the <strong>MAXIMUM</strong> runtime of <code>p(n)</code> differ with respect to time per each <code>n</code> -- that is, what are the bounds of <code>p(n)</code> with ... | 681 |
question answering | Turing decidable languages | https://cs.stackexchange.com/questions/139532/turing-decidable-languages | <p>On an old worksheet I came across the question</p>
<blockquote>
<p>If L<sub>1</sub> and L<sub>2</sub> are two Turing decidable languages, then show that 𝐿<sub>1</sub>∪𝐿<sub>2</sub> and 𝐿<sub>1</sub>𝑜𝐿<sub>2</sub> are Turing decidable languages (high-level description with stages is enough).</p>
</blockquote>
<p... | <p>Both <span class="math-container">$L_1$</span> and <span class="math-container">$L_2$</span> are decidable. Hence, they have algorithms <span class="math-container">$A_1$</span> and <span class="math-container">$A_2$</span> (respectively) that decide them.</p>
<p>Try to create a new turing machine (algorithm) using ... | 682 |
question answering | How is momentum an approximation of Hessian based optimization? | https://cs.stackexchange.com/questions/106053/how-is-momentum-an-approximation-of-hessian-based-optimization | <p>In the answer to "what is the Hessian" at this site:</p>
<p><a href="https://stackoverflow.com/questions/23297090/how-calculating-hessian-works-for-neural-network-learning">https://stackoverflow.com/questions/23297090/how-calculating-hessian-works-for-neural-network-learning</a></p>
<p>the person answering the que... | 683 | |
question answering | Local and Global storage with multithreading pools + locking threads | https://cs.stackexchange.com/questions/24750/local-and-global-storage-with-multithreading-pools-locking-threads | <p>I am having difficulty answering the following questions relating to the use of threading.</p>
<p>Question 1 is of relating to the possibility of a local storage per thread and a global storage accessible to all threads. Consider the following scenario; A program creates a series of threads each with their own loca... | <p>I will answer Question 1. As @DavidRicherby said, you should post the other question separately.</p>
<p>The <em>space complexity</em> is the <em>maximum</em> amount of space required while the algorithm is running. So it certainly would be more than the (number of elements in matrix) + (local storage of just finis... | 684 |
question answering | Can machines of finite size ever solve their own halting problems? | https://cs.stackexchange.com/questions/86607/can-machines-of-finite-size-ever-solve-their-own-halting-problems | <p>A real-life computer can only store programs and inputs up to a certain length, which means that its halting problem can be solved with a lookup table. The most obvious way to represent this table grows exponentially with the number of bits in the computer's state description, and so wouldn't fit inside the memory o... | 685 | |
question answering | Time complexity and content free evaluation | https://cs.stackexchange.com/questions/162592/time-complexity-and-content-free-evaluation | <p>I am having trouble answering the question below:</p>
<p>"Explain why the statement, “The running time of algorithm A is at least O(n^2)”, is content-free."</p>
<p>The statement apparently does not give any information on the running time of A but if A = T(n), then T(n) >= O(n^2). Doesn't this at the ve... | <p>As suggested by <a href="https://cs.stackexchange.com/users/6759/steven">Steven</a>, I turned my comment into a full answer.</p>
<p>I think the question aims to point out that for a constant running time <span class="math-container">$c$</span> you have <span class="math-container">$c \in \mathcal{O}(1) \subseteq \ma... | 686 |
question answering | Time complexity of languages recognized by linear bounded automata with restricted number of writes | https://cs.stackexchange.com/questions/72343/time-complexity-of-languages-recognized-by-linear-bounded-automata-with-restrict | <p>Suppose that $L$ is a language recognized by a linear-bounded automaton with the constraint that it can only change each of its input cells at most $t$ times each, where $t$ is some constant integer. Must $L$ belong to $P$, the class of languages decidable in polynomial time? Even more stringently, does there exist ... | 687 | |
question answering | Can partially observable MDPs be fully observable nonetheless? | https://cs.stackexchange.com/questions/143030/can-partially-observable-mdps-be-fully-observable-nonetheless | <p>I've read through a few definitions of a partially observable environment/MDP, and I need confirmation whether the <em>partial observability</em> is really a <em>generalization</em> of a MDP (misnomer) and not a <em>required</em> feature, just like when we call nondeterministic automata the union of a) deterministic... | <p>Every MDP can be transformed into a POMDP (partially observable MDP), such that the signal (observation) is the state itself. There is no benefit in doing so, but it is still a valid transformation.</p>
<p>In this sense, Tic-Tac-Toe is fully observable (you see the entire state you are in, and not a partial signal f... | 688 |
question answering | How to Determine Places, Transitions and Tokens in a Scenario when Modeling with Petri Nets? | https://cs.stackexchange.com/questions/71814/how-to-determine-places-transitions-and-tokens-in-a-scenario-when-modeling-with | <p>When modeling a scenario with Petri nets how should I determine the places, transitions and tokens?</p>
<p><strong>Example:</strong> </p>
<p>There are two exam assistants in an exam hall observing the exam. They stand in front of the exam hall. When a student has a question one of the assistants goes to him and an... | <p>If you find it challenging to apply Petri Nets in modeling an application then it may help to consider the following mapping between the types of words found in a text description of an application with the types of Petri Net elements found in a Petri Net diagram of the application:</p>
<ol>
<li>Nouns are candidate... | 689 |
question answering | The origin and the meaning of "Abstract Syntax Tree" | https://cs.stackexchange.com/questions/81993/the-origin-and-the-meaning-of-abstract-syntax-tree | <p>This question is closely related to <a href="https://cs.stackexchange.com/q/13126"><em>Does an abstract syntax tree have to be a tree?</em></a> and is partially answered there, but I would like to be more precise and to have more concise answers.</p>
<ol>
<li><p>What is the origin of the term?</p></li>
<li><p>Are t... | <p>You are asking three questions. I will answer one.</p>
<p>I don't think "abstract syntax tree" is a misnomer. It aims to represent the <em>syntax</em> of the expression. It is not claimed to represent all of the meaning (semantics) of the expression. The issue with bound variables that you mention relates to se... | 690 |
question answering | "OOD allows ADTs to be created and used." | https://cs.stackexchange.com/questions/13503/ood-allows-adts-to-be-created-and-used | <p>I just had a CS mid-term and one of the questions was:</p>
<blockquote>
<p>OOD allows ADTs to be created and used.</p>
<ul>
<li>True</li>
<li>False</li>
</ul>
</blockquote>
<p>I answered false, but my answer was marked as incorrect. I suspect what the question means is "objected-oriented design can be... | <p>First, if this is exactly the sentence on the exam and not your translation, it's ambiguous. It could mean that OOD is one possible way to create and use ADT, or that creating and using ADTs requires OOD.</p>
<p>Furthermore, ADT can mean two things: <a href="http://en.wikipedia.org/wiki/Abstract_data_type">abstract... | 691 |
question answering | Radial Basis kernel producing the same decision boundary as a Linear kernel | https://cs.stackexchange.com/questions/148180/radial-basis-kernel-producing-the-same-decision-boundary-as-a-linear-kernel | <p>The following question is from the MIT 6.034 2006 Final Exam paper.</p>
<p><a href="https://i.sstatic.net/KRH2j.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/KRH2j.png" alt="Image from the MIT 6.034 2006 Final Exam paper" /></a>In answering part 6.5, I wasn't certain why the radial basis kernel woul... | 692 | |
question answering | Bayesian Network - Inference | https://cs.stackexchange.com/questions/13803/bayesian-network-inference | <p>I have the following Bayesian Network and need help with answering the following query.</p>
<p><img src="https://i.sstatic.net/30XAh.jpg" alt="enter image description here"></p>
<p><strong>EDITED:</strong></p>
<p>Here are my solutions to questions a and b:</p>
<p><strong>a)</strong></p>
<pre><code>P(A,B,C,D,E) ... | <p>You're on the right path. Here's my suggestion. First, apply the definition of conditional probability:</p>
<p>$$ \Pr[e|a,c,\neg b] = {\Pr[e,a,c,\neg b] \over \Pr[a,c,\neg b]}. $$</p>
<p>So, your job is to compute both $\Pr[e,a,c,\neg b]$ and $\Pr[a,c,\neg b]$. I suggest that you do each of them separately.</p>... | 693 |
question answering | Confusion converting BNF to regular expression | https://cs.stackexchange.com/questions/76839/confusion-converting-bnf-to-regular-expression | <p>I have a Computer Science A-Level exam tomorrow and I've been trying to get this question answered by my teacher but she's not been too helpful so asking here instead.</p>
<p>In an exam question, I have the following BNF grammar, where <code>_</code> denotes a space.</p>
<pre><code><fullname> ::= <title&g... | <p>There are two ways of interpreting 'the first rule can be represented with a regular expression'; you should review this 'mark scheme' to determine which applies. One possibility is that the first rule is being treated as defining a language over its own terminals and non-terminals, without ever expanding the non-t... | 694 |
question answering | How good are current AI researchers at simulating complex, first-person emotional states? | https://cs.stackexchange.com/questions/13815/how-good-are-current-ai-researchers-at-simulating-complex-first-person-emotiona | <p>I just read that IBM's Watson would have a hard time answering questions like "tell me about your first <a href="http://blogs.discovermagazine.com/sciencenotfiction/2010/06/28/watson-fails-the-turing-test-but-just-might-pass-the-jeopardy-test/#.UhH7QGTF1vZ" rel="nofollow">kiss</a>." If you asked a modern, state-of-t... | <p>Great Question! One area to look into is Cognitive Architectures. These are computer programs that solve AI problems by modeling how humans think and feel (emotion). Here is a brief overview.</p>
<p>Prior to the mid-1980s the study of AI was concerned with creating general intelligent systems modeled after flexi... | 695 |
question answering | Language to Generate Powers of 2 Using a Language Containing Decimal Numbers | https://cs.stackexchange.com/questions/108662/language-to-generate-powers-of-2-using-a-language-containing-decimal-numbers | <p>For this question, I have the alphabet <span class="math-container">$\Sigma=\{0,1,2,3,4,5,6,7,8,9\}$</span>. I also have the language <span class="math-container">$L$</span> over <span class="math-container">$\Sigma$</span> described as the language such that the strings <span class="math-container">$w$</span> conta... |
<h3>L is not context-free</h3>
<p><strong>Periodicity for context-free languages of bounded growth</strong>: Let <span class="math-container">$w_n$</span> be the number of words of length <span class="math-container">$n$</span> in a given regular language. If the sequence <span class="math-container">$w_1, w_2, \cdots... | 696 |
question answering | Machine Learning: What program will derive the underlying algorithm in this series? | https://cs.stackexchange.com/questions/19638/machine-learning-what-program-will-derive-the-underlying-algorithm-in-this-seri | <p>This is a machine learning question. Given this series of categorical data, what program will derive the underlying algorithm and predict what comes next in the series?</p>
<p>Here is the series:</p>
<p>B, BA, BB, BAA, BAB, BBA, BBB, BAAA, BAAB, BABA, ...</p>
<p>Anyone with knowledge of computer science may quick... | <p>Without any a priori knowledge, the problem is insoluble. There are infinitely many possible answers and you have no wat at all to say that one of them is preferable to any of the others. How can you possibly tell just by manipulating symbols that the sequence is "Counting in binary using A and B for 0 and 1" rather... | 697 |
question answering | OCR Computing Question | https://cs.stackexchange.com/questions/54350/ocr-computing-question | <p>I was asked the below question in a test at school last week and I thought the answer given was incorrect.</p>
<p>You had to give a file format from the options for the below statement:</p>
<p>A file created in software that most users will not have available</p>
<p>You had two options, PDF or DOCX. I answered DO... | <p>This looks like an advertisement for Microsoft...</p>
<p>The intention was that while DOCX can be created using the rather expensive but commonly available Microsoft Word, PDF is created by Adobe Acrobat (not the free Reader!) which is not commonly available. However, there are many other ways to create PDFs, and n... | 698 |
question answering | Another vertex cover question? | https://cs.stackexchange.com/questions/115093/another-vertex-cover-question | <p>I'm not sure this is equivalent to bipartite vertex cover question. The question is:</p>
<p>Given a BIPARTITE graph, what is the minimum number of vertex from the right side whose edges cover all vertex from the left side. </p>
<p>e.g. In the following graph, the answer is 1, cause vertex g has connection to all v... | <p>It is equivalent to the <a href="https://en.wikipedia.org/wiki/Set_cover_problem" rel="nofollow noreferrer">set cover problem</a>. You can regard each vertex in the right side as a set of its neighbors in the left side. In your example, <span class="math-container">$e,f,g$</span> correspond respectively to the sets ... | 699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.