tcs   640

« earlier    

Non-Convex Optimization for Machine Learning | Hacker News
Discussion on non-convex optimization for ML. HN: "> Put a bit more dramatically, [this monograph] will seek to show how problems that were once avoided, having been shown to be NP-hard to solve, now have solvers that operate in near-linear time, by carefully analyzing and exploiting additional task structure!"
tcs  optimization  ml  cs  hn  discussion  paper 
7 weeks ago by joecamel
The advantages of using AI in Insurance | Expert System
The Insurance is an industry notorious to be full of data, but using AI companies can improve their strategic processes. Learn more!
insurance  ai  tcs 
november 2017 by automationeye
If Quantum Computers are not Possible Why are Classical Computers Possible? | Combinatorics and more
As most of my readers know, I regard quantum computing as unrealistic. You can read more about it in my Notices AMS paper and its extended version (see also this post) and in the discussion of Puzzle 4 from my recent puzzles paper (see also this post). The amazing progress and huge investment in quantum computing (that I presented and update  routinely in this post) will put my analysis to test in the next few years.
tcstariat  mathtariat  org:bleg  nibble  tcs  cs  computation  quantum  volo-avolo  no-go  contrarianism  frontier  links  quantum-info  analogy  comparison  synthesis  hi-order-bits  speedometer  questions  signal-noise 
november 2017 by nhaliday
Rank aggregation basics: Local Kemeny optimisation | David R. MacIver
This turns our problem from a global search to a local one: Basically we can start from any point in the search space and search locally by swapping adjacent pairs until we hit a minimum. This turns out to be quite easy to do. _We basically run insertion sort_: At step n we have the first n items in a locally Kemeny optimal order. Swap the n+1th item backwards until the majority think its predecessor is < it. This ensures all adjacent pairs are in the majority order, so swapping them would result in a greater than or equal K. This is of course an O(n^2) algorithm. In fact, the problem of merely finding a locally Kemeny optimal solution can be done in O(n log(n)) (for much the same reason as you can sort better than insertion sort). You just take the directed graph of majority votes and find a Hamiltonian Path. The nice thing about the above version of the algorithm is that it gives you a lot of control over where you start your search.
techtariat  liner-notes  papers  tcs  algorithms  machine-learning  acm  optimization  approximation  local-global  orders  graphs  graph-theory  explanation  iteration-recursion  time-complexity  nibble 
september 2017 by nhaliday

« earlier    

related tags

2017-07-06  2017-07-08  2017  aaronson  abstraction  academia  accretion  acm  acmtariat  advice  aesthetics  ai  alg-combo  algebraic-complexity  algorithmic-econ  algorithms  analogy  announcement  applications  approximation  arrows  atoms  automation  baez  bare-hands  beauty  ben-recht  berkeley  bias-variance  big-list  big-picture  big-surf  bio  bioinformatics  bits  blog  boaz-barak  bonferroni  book  books  boolean-analysis  caching  calculation  characterization  chart  chicago  circuits  classic  coding-theory  cog-psych  combo-optimization  commentary  communication-complexity  comparison  complex-systems  complexity  composition-decomposition  computation  computer  concentration-of-measure  concept  conceptual-vocab  conference  confluence  confusion  constraint-satisfaction  consulting  contrarianism  convexity-curvature  coordination  cornell  counting  course  crypto  cryptography  cs  curiosity  curvature  dana-moshkovitz  data-science  data-structures  debugging  deep-learning  definition  dimensionality  direction  discussion  distributed  dp  draft  duality  dystopia  embeddings  encyclopedic  engineering  entropy-like  equilibrium  erik-demaine  error  essay  estimate  evolution  examples  existence  expanders  expectancy  expert-experience  expert  explanation  exposition  extrema  fails  feynman  fields  finiteness  fourier  frontier  functional  game-theory  geometry  georgia  giants  gowers  grad-student  gradient-descent  graph-theory  graphs  greedy  ground-up  gt-101  gwas  hamming  hard-core  hardness  harvard  hashing  heterodox  hi-order-bits  hierarchy  high-dimension  history  hn  ideas  iidness  impact  india  info-dynamics  information-theory  infosys  init  insurance  integral  interdisciplinary  interpretability  intersection-connectedness  intersection  interview  intricacy  intro  introduction  israel  iteration-recursion  iterative-methods  knowledge  learning-theory  lecture-notes  lectures  legibility  lens  levers  limits  linear-algebra  linear-programming  linearity  liner-notes  links  list  local-global  logic  lower-bounds  luca-trevisan  luca.trevisan  machine-learning  madhu-sudan  magnitude  markov  matching  math.nt  math.rt  math  mathtariat  measure  mechanics  meta:math  meta:research  metabuch  metameta  metric-space  metrics  mihai  mit  mixing  ml  models  monte-carlo  motivation  mrtz  multi  narrative  naturality  network-structure  news  nia  nibble  nlp  no-go  ocw  oly-programming  oly  online-learning  open-problems  optimization  orders  org:bleg  org:edu  org:inst  org:mag  org:mat  org:sci  orourke  overflow  overview  p:**  p:someday  p:whenever  pac  paper  papers  pcp  pdf  people  percolation  phase-transition  philosophy  physics  pigeonhole-markov  play  polynomials  popsci  positivity  postmortem  pragmatic  preprint  presentation  princeton  probabilistic-method  probability  problem-solving  professor  profile  programming  proof-systems  proofs  pseudorandomness  psychology  publishing  pvsnp  q-n-a  qra  quantum-info  quantum  questions  quotes  rand-approx  rand-complexity  random-networks  random  ranking  recommendations  reduction  reference  reflection  relativization  relaxation  research-program  research  rigidity  rigor  rigorous-crypto  rounding  ryan-odonnell  s:***  s:*  s:null  salil-vadhan  sampling  sanjeev-arora  scaling-tech  scholar  science  sdp  sebastien-bubeck  security  sensitivity  shannon  signal-noise  signaling  signum  similarity  simulation  skeleton  slides  soft-question  sos  space-complexity  sparsity  spatial  speedometer  stanford  stat-mech  stochastic-processes  stock-flow  stories  stream  structure  student  sublinear  summary  synthesis  talks  tata  tcstariat  teaching  tech  technology  techtariat  the-trenches  the-world-is-just-atoms  theoretical-cs  theoretical  thermo  thinking  tidbits  tim-roughgarden  time-complexity  toolkit  top-n  topics  tradeoffs  trees  tricki  turing  ugc  unit  unsupervised  valiant  vazirani  video  volo-avolo  web  wigderson  wiki  wipro  within-without  wormholes  yoga  zero.knowledge  👳  🔬 

Copy this bookmark: