greedy   96

« earlier    

Regex Quantifier Tutorial: Greedy, Lazy, Possessive
Regex Quantifiers Tutorial. Explains the fine details of quantifiers, including greedy, lazy (reluctant) and possessive.
regex  quantifier  greedy  reluctant  possessive 
december 2017 by lgtout
Sequence Modeling with CTC
A visual guide to Connectionist Temporal Classification, an algorithm used to train deep neural networks in speech recognition, handwriting recognition and other sequence problems.
acmtariat  techtariat  org:bleg  nibble  better-explained  machine-learning  deep-learning  visual-understanding  visualization  analysis  let-me-see  research  sequential  audio  classification  model-class  exposition  language  acm  approximation  comparison  markov  iteration-recursion  concept  atoms  distribution  orders  DP  heuristic  optimization  trees  greedy  matching  gradient-descent 
december 2017 by nhaliday
[1704.01652] Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization
"It is known that greedy methods perform well for maximizing monotone submodular functions. At the same time, such methods perform poorly in the face of non-monotonicity. In this paper, we show - arguably, surprisingly - that invoking the classical greedy algorithm O(k√)-times leads to the (currently) fastest deterministic algorithm, called Repeated Greedy, for maximizing a general submodular function subject to k-independent system constraints. Repeated Greedy achieves (1+O(1/k√))k approximation using O(nrk√) function evaluations (here, n and r denote the size of the ground set and the maximum size of a feasible solution, respectively). We then show that by a careful sampling procedure, we can run the greedy algorithm only once and obtain the (currently) fastest randomized algorithm, called Sample Greedy, for maximizing a submodular function subject to k-extendible system constraints (a subclass of k-independent system constrains). Sample Greedy achieves (k+3)-approximation with only O(nr/k) function evaluations. Finally, we derive an almost matching lower bound, and show that no polynomial time algorithm can have an approximation ratio smaller than k+1/2−ε. To further support our theoretical results, we compare the performance of Repeated Greedy and Sample Greedy with prior art in a concrete application (movie recommendation). We consistently observe that while Sample Greedy achieves practically the same utility as the best baseline, it performs at least two orders of magnitude faster."
papers  submodularity  optimization  algorithms  greedy  approximation 
april 2017 by arsyed
Difference between off-policy and on-policy learning - Cross Validated
The reason that Q-learning is off-policy is that it updates its Q-values using the Q-value of the next state s′ and the greedy action a′. In other words, it estimates the return (total discounted future reward) for state-action pairs assuming a greedy policy were followed despite the fact that it's not following a greedy policy.

The reason that SARSA is on-policy is that it updates its Q-values using the Q-value of the next state s′ and the current policy's action a″. It estimates the return for state-action pairs assuming the current policy continues to be followed.

The distinction disappears if the current policy is a greedy policy. However, such an agent would not be good since it never explores.
q-n-a  overflow  machine-learning  acm  reinforcement  confusion  jargon  generalization  nibble  definition  greedy  comparison 
february 2017 by nhaliday
Regex Quantifier Tutorial: Greedy, Lazy, Possessive
Negated Class Solution

Suppose we know that the character { will never be present between the delimiters {START} and {END}. Instead of the lazy quantifier, we can use a negated character class in our pattern:

{START}[^{]*{END}

The negated character class [^{]* greedily matches zero or more characters that are not an opening curly brace. Therefore, we are guaranteed that the dot-star will never jump over the {END} delimiter. This is a more direct and efficient way of matching between {START} and {END}.

https://stackoverflow.com/questions/4373508/regular-expressions-how-to-find-the-bit-between-the-in-an-email
regex  quantifiers  greedy  lazy  StackExchange 
november 2016 by coffeebucket
Twitter
RT : What are YOU Smoking? This for consumers; Only co's love.Who's your target audience?
greedy  sucks  from twitter
june 2016 by gaelicWizard
regex - How can I make my match non greedy in vim? - Stack Overflow
Instead of .* use .\{-}.

%s/style=".\{-}"//g

Also, see :help non-greedy
vim  regex  non  greedy 
april 2016 by christianmlong

« earlier    

related tags

?  2.0  2008  2017-06-22  2017-06-24  2017-06-26  2017-06-28  2017-06-30  a*  a  aaronson  accelerated-greedy  acm  acmtariat  active-learning  active  agile  algorithm  algorithms  aligned  all_of_them  allwrong  altruistic  am  american  analysis  anarchism  ann-arbor  apple  approximation  article  artificial  at&t  atoms  audio  auto  backtracking  balls  bandit  bandits  bastards  beer  behavioral  behaviorial  better-explained  big-list  big-picture  blog  blogging  book  branding  brewpub  broken  bs  capital  capitalism  caption  captioned  car  cat  cdo  ceo  chair  chapter  charity  chart  china  cilkchess  circlejerk  classification  clojure  clone  collaborative  combo-optimization  command  commerce  communism  comparison  competitive  complexity  computation  computer  concept  confusion  constraint-satisfaction  contextual  convexity-curvature  cop3502  cop3503  corporate  course  cpsc413  creative  criminal  cs  cumbersome  curvature  cute  data-selection  deep-learning  defensive  definition  dependencies  design  destructive  dev  devel  development  dijkstra  distribution  dns  dog  domains  dp  dynamic  eclipse  economic-development-will-destroy-the-city  economical  education  efficient  employers  energy  epsilon  essay  ethical  evil  exclusive  exposition  expression  expressions  facebook  fair  farmer  fb  financial  follow  follower  followers  follows  food  forcing  free  freestuff  fromtcf  fuckers  game  games  gaming  general  generalization  genius  geometry  girl.  global  google  googlereader  gop  gradient-descent  grand  graph-theory  graph  graphs  greed  greedygiveaway  green  grep  gta  gta2  guide  hall_of_fame  harmful  he  hedonic  helpful  heuristic  hi-order-bits  history  hoarding  honest  honorable  hostile  howto  i  i_do  ifttt  illegal  image  imperialism  influential  intellectual  interesting  internet  into  intuitive  is  iteration-recursion  jargon  java  javascript  just  klare  knowledge  kruskal  labor  lagrangian  landlords  language  law  lazy  lecture  legal  let-me-see  like  likes  linear-algebra  linearalgebra  linux  list  local  machine-learning  magical  magnetar  management  manipulation  marginal  market  markov  matching  math.co  math.mg  math.nt  math  mathtariat  matrix  matroid  meet  merge  metabuch  metameta  michigan  mit  mmm  model-class  money  monte-carlo  mst  multiplication  multithreaded  multithreading  nations  need  needy  new  newbie  nibble  non-greedy  non  nongreedy  not  not_evil  oly-programming  oly  on  open  opportunistic  oppose  optimization  optimize  orders  org:bleg  overflow  p2  papers  parallel  parallelism  patternmatching  patterns  paul  pay  pcre  perfect  perl  phone  pig  plus  political  polynomials  positive  possessive  post  poverty  powerful  prim  private  probability  problems  programming  proofs  proprietary  psychological  public  pug  puzzles  python  q-n-a  quantifier  quantifiers  question  raheem  randomization  rat  rational  recession  reciprocal  reference  regex  regexes  regexp  regular  regularexpressions  reinforcement  relaxation  reluctant  repetitions  research  researching  resources  restrictive  rigid  rival  rivalrous  ruby  s:***  sad  scabby  scarce  scheduler  scheduling  sdl  sed  selfish  selfishness  sequential  shared  shockdoctrine  sick  singer:  situational  skeleton  society  socrates  solutions  sophistpundit  sort  spectral-methods  speed  speedup  stackexchange  star  stateofthecat  sterling  stochastic  stock-flow  strategic  strike  structure  submodularity  subset-selection  subversive  sucks  superstar  survival  syntax  synthesis  tcs  tcstariat  tea  techtariat  text  the  theft  thenation  theses  thieves  thisvsthat  thompson  time-complexity  timesonline  tip  tipping  tips  top-n  toys  trees  tricki  tutorial  ungreedy  unit  unix  usaco-ioi  usdor  vi  video  vim  violent  viral  visual-understanding  visualization  vulture  wankers  wasteful  web  wechat  whining  whole  wikipedia  workers  worthitdoh  yes  yoga  youtube 

Copy this bookmark:



description:


tags: