Re: [Idnet] Seminar from Andrea Goldsmith (Stanford) on AI and Communication Systems

Marie-Jose Montpetit <marie@mjmontpetit.com> Mon, 02 April 2018 02:11 UTC

Return-Path: <marie@mjmontpetit.com>
X-Original-To: idnet@ietfa.amsl.com
Delivered-To: idnet@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 3FA79126D74 for <idnet@ietfa.amsl.com>; Sun, 1 Apr 2018 19:11:15 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.6
X-Spam-Level:
X-Spam-Status: No, score=-2.6 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=mjmontpetit-com.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id CiKNvEuSOB9g for <idnet@ietfa.amsl.com>; Sun, 1 Apr 2018 19:11:13 -0700 (PDT)
Received: from mail-qk0-x22c.google.com (mail-qk0-x22c.google.com [IPv6:2607:f8b0:400d:c09::22c]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 8784B1243F3 for <idnet@ietf.org>; Sun, 1 Apr 2018 19:11:13 -0700 (PDT)
Received: by mail-qk0-x22c.google.com with SMTP id v2so13839629qkh.10 for <idnet@ietf.org>; Sun, 01 Apr 2018 19:11:13 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=mjmontpetit-com.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=a/FyxUx7ZCIECTgyRvIiRr6WFZ3T2VLKqvXjlEeYg4g=; b=bOtPllis4mbcHG53RmMNFajjhSmArxkhzuA/YEFUtdx/sng9Q1JGAN42IVpuaoE9oi cPJ5zRII995QND0tdZkVDPLRXJu5qu97Y0U9SrnXQj2F2snLLZXv8AbI8Y9DHDpN3Vn0 m7fKDL4QIDV9yCIx8xPOiHAMPvZBF6vLYQP+DCdMFKvUhPKBKkJvt6AdLrYOf3x4Megs 2hD1FqEvkVwdmE52ez7uEyQ2WkPwJ+lao2t5zLf36UaZ6JeTlS3pMd6j0YGwRMmYgBUE i27IjX9qKnJFypQxHdEXLSlWIud2I54TtIuqshnb9kTdOb5SSqJcM8LQfk3W7P2t7g96 Mcqg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=a/FyxUx7ZCIECTgyRvIiRr6WFZ3T2VLKqvXjlEeYg4g=; b=f8KIR+MahEiNuXzyFRl9n6/xzNwMVFYZx+GqwFgSif26PnQmUAB2QVCRK2oRLAH78D sOirgwDV8oShDmuWPOU9230qKGWGND0bbXr98sTxGnzNgKGf4MjAW+cRAzh83hT5P7ky 4hVjvrihjnfBTNLRexnpts/Ynk6cds1NTVlnVlwSXm7Hd2rO9znFxZaM6pel5Nx4TY1E KhqUwZxo+RyX9o2f20kqXhV0nFJLdmbIoKWr5JNXqgnGwx5GWPIZKvF2knMqzrQTsiwA s7NKjIvZpWvFTpsqR62B0hoIJspIR2hFbzl2N9vjnRLjT+roayun6XBq+ayWgDiuDpJ8 6z2w==
X-Gm-Message-State: ALQs6tC5OVDCqQ+Oes8/vSSAN7IUD2jrb/CRusEaGlD2MLeGgtVy0Wk+ bNnv1lP5JcSon1KWUE+SAMv2OA==
X-Google-Smtp-Source: AIpwx48XimZ+uPiQoS+v0YHeJSNeBjRi4fDqlVV+8muaabRxMLcbVbEa70XtqwFt65lcb5oMsB3hFw==
X-Received: by 10.55.173.13 with SMTP id f13mr10637665qkm.119.1522635072587; Sun, 01 Apr 2018 19:11:12 -0700 (PDT)
Received: from winterfell.fios-router.home (pool-98-110-172-30.bstnma.fios.verizon.net. [98.110.172.30]) by smtp.gmail.com with ESMTPSA id r11sm10051745qkk.86.2018.04.01.19.11.11 (version=TLS1 cipher=ECDHE-RSA-AES128-SHA bits=128/128); Sun, 01 Apr 2018 19:11:11 -0700 (PDT)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 9.3 \(3124\))
From: Marie-Jose Montpetit <marie@mjmontpetit.com>
In-Reply-To: <20180402014349.GC10148@spectre>
Date: Sun, 1 Apr 2018 22:11:10 -0400
Cc: idnet@ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <D3F7C7F2-AC7A-4E8F-BB6C-49B12D0885E9@mjmontpetit.com>
References: <8C38FF6D-E44C-436B-88CD-1C51D5306E3F@mjmontpetit.com> <3169CEEE-BAD1-475F-B216-A86D16C308E2@mjmontpetit.com> <20180402014349.GC10148@spectre>
To: Pedro Martinez-Julia <pedro@nict.go.jp>
X-Mailer: Apple Mail (2.3124)
Archived-At: <https://mailarchive.ietf.org/arch/msg/idnet/dgbqBejMlK5aJgabicmzXbUUd38>
Subject: Re: [Idnet] Seminar from Andrea Goldsmith (Stanford) on AI and Communication Systems
X-BeenThere: idnet@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: "The IDNet \(Intelligence-Defined Network\) " <idnet.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/idnet>, <mailto:idnet-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/idnet/>
List-Post: <mailto:idnet@ietf.org>
List-Help: <mailto:idnet-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/idnet>, <mailto:idnet-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 02 Apr 2018 02:11:15 -0000

I will try to find the information. There will be an article in JSAC soon also.
> On Apr 1, 2018, at 9:43 PM, Pedro Martinez-Julia <pedro@nict.go.jp>; wrote:
> 
> Dear Marie-Jose,
> 
> Thank you for sharing the report but, IMHO, without some backing slides
> or similar, such information just makes us anxious of more details about
> the solution :-D. Please, if possible, share the slides, a more detailed
> report, a video of the event, or something that we can use to study such
> solution. Thank you very much.
> 
> Regards,
> Pedro
> 
> On Wed, Mar 28, 2018 at 04:48:59PM -0400, Marie-Jose Montpetit wrote:
>> Andrea was in MIT yesterday and she presented a seminar entitiled: Can machine learning beat theory in communication system design?”
>> (fo those of you who do not know Andrea I suggest you Google her but in any case she is a highly reknowned wireless researcher from Stanford)
>> 
>> She first explained why communications theory may not be enough to analyse next gen networks (she called them nG) because time-variance or lack of a real channel model (molecular communication which is like diffusion) and the need maybe to design new PHY especially for cellular for example questioning the frequency re-use model still used to define the cells and deal with interference.
>> 
>> SHe went on to describe how her team use subject specific knowledge to define a new type of neural networks with sliding windows (a reference actually to coding where sliding window codes usually have the best performance).
>> 
>> She applied the new ML to 2 cases: one estimation and the other for words recognition in the presence of noise (the famous source-destination joint coding problem) and 2 channels: a traditional Poisson channel and a molecular channel with base/acid representing 0s and 1s (another model BTW is the “vodka model where 1 shot is 1 and water is 0).  The comparison on the Poisson channel was of course with the Viterbi Algorithm which is optimal when the channel is perfectly known. 
>> 
>> The results (to be published) show that of course when there is no uncertainty on the channel Viterbi is good. But the ML is consistently as much as good as optimal even as the uncertainty increases (like in a fast varying channel) and when under that uncertainty the Viterbi estimation degrades rapidly.
>> 
>> With the pure molecular channel of course ML is the only solution and the results with the word recognition were excellent (next is imaging and video) because ML allows to dd semantics not just bit detection. Molecular channels BTW are considered for in-body communications.
>> 
>> The conclusion was that with the nG communications ML may provide better results than traditional methods given that they are driven by subject experts not just a generic ML algorithm. Questions that remain include timing and repeating of the neural network training that of course would be system dependent.
>> 
>> 
>> mjm
>> 
>> Marie-Jose Montpetit, Ph.D.
>> mariejo@mit.edu
>> marie@mjmontpetit.com
>> +1-781-526-2661
>> @SocialTVMIT
>> 
>> 
>> 
>> 
>> _______________________________________________
>> IDNET mailing list
>> IDNET@ietf.org
>> https://www.ietf.org/mailman/listinfo/idnet
> 
> -- 
> Pedro Martinez-Julia
> Network Science and Convergence Device Technology Laboratory
> Network System Research Institute
> National Institute of Information and Communications Technology (NICT)
> 4-2-1, Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan
> Email: pedro@nict.go.jp
> ---------------------------------------------------------
> *** Entia non sunt multiplicanda praeter necessitatem ***