Date: Fri, 10 Jun 2022 18:31:35 -0400
sg14 at CppCon is an interesting idea. If that's the plan, please tell us
in advance such that I ask Jon not to schedule my talk(s) the same day.
Thanks!
Le ven. 10 juin 2022 à 11:44, Michael Wong via SG19 <sg19_at_[hidden]>
a écrit :
>
>
> On Wed, Jun 8, 2022 at 3:15 PM Michael Wong <fraggamuffin_at_[hidden]>
> wrote:
>
>> Hi all, SG19 Machine Learning meeting will focus on graphs. Michael Wong
>> is inviting you to a scheduled Zoom meeting.
>>
>> Topic: SG19 monthly
>> Time: 02:00 PM Eastern Time (US and Canada)
>> Every month on the Second Thu,
>>
>>
>> Join from PC, Mac, Linux, iOS or Android:
>>
>> https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09
>> Password: 035530
>>
>> Or iPhone one-tap :
>> US: +13017158592,,93084591725# or +13126266799,,93084591725#
>> Or Telephone:
>> Dial(for higher quality, dial a number based on your current
>> location):
>> US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1
>> 408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782
>> or 877 853 5247 (Toll Free)
>> Meeting ID: 930 8459 1725
>> Password: 035530
>> International numbers available: https://iso.zoom.us/u/agewu4X97
>>
>> Or Skype for Business (Lync):
>> https://iso.zoom.us/skype/93084591725
>>
>> Agenda:
>>
>> 1. Opening and introductions
>>
>> The ISO Code of conduct:
>> https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf
>>
>> IEC Code of Conduct:
>>
>> https://www.iec.ch/basecamp/iec-code-conduct-technical-work
>>
>> ISO patent policy.
>>
>>
>> https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2
>>
>> The WG21 Practices and Procedures and Code of Conduct:
>>
>> https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures
>>
>> 1.1 Roll call of participants
>>
>
>
>> Chris Ryan, Jens Maurer, Kevin Dewesee, Ozan Irsoy, Phil Ratzloff, Rene
>> Rivera, Richard Dosselment, Scott McMillan, MIchael Wong, ka ming chan,
>> Will wray
>>
>> 1.2 Adopt agenda
>>
>> 1.3 Approve minutes from previous meeting, and approve publishing
>> previously approved minutes to ISOCPP.org
>>
>> 1.4 Action items from previous meetings
>>
>> 2. Main issues (125 min)
>>
>> 2.1 General logistics
>>
>> Meeting plan, focus on one paper per meeting but does not preclude other
>> paper updates:
>>
>>
>>
>> June 9, 2022 02:00 PM ET: Graph
>> Jul 14, 2022 02:00 PM ET: Matrix, RL and DC
>> Aug 11, 2022 02:00 PM ET: Stats
>> Sep 13, 2022 02:00 PM ET: Graph
>> Oct 12, 2022 02:00 PM ET: Matrix RL/DC
>>
>> ISO meeting status
>>
>> future C++ Std meetings
>>
> https://cppcon.org/cfs2022/ The submissions deadline is June 24th,
> with decisions sent by July 31st.
>
>
>>
>>
>> 2.2 Paper reviews
>>
>> 2.2.1: ML topics
>>
>> 2.2.1.1 Graph Proposal Phil Ratsloff et al
>>
>> Latest paper:
>>
>> Here’s a link to the paper (different than the previous paper reviewed).
>> There are some additional updates I’m planning on making before the
>> meeting.
>>
>>
>> https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing
>>
>>
>> edgeless view
> 2nd set of functions are for edges on a specific vertex
> not supporting due to pairing down so it is returning incoming edges as
> well
> neighbors now instead of adjacency and get source_id and target_id
> undirected incidence graph
> concept bounds polymorphism on an algo, or like an abstract base class:
> the undirected incidence and directed incidence graph, the algo used should
> be well defined - when algo gets target_id, in an undirected graph, it goes
> to a specific value which is well-defined, but the physical storage can be
> element 0 source, and 1 is the target for directed graph, but undirected
> element 0 or 1 could be source or target
>
> undirected graph needs a source-incidence graph (both a source and target
> id on an edge), directed vs undirected through emulation?
> do we need to store source id?
> undirected edge value
> undirected graph needs a source and target since we need to know where we
> came from
>
> different names for directed vs undirected or should be unordered on the
> edge
> terminology should reflect the math
> better term? unordered edge/ vertices, as long as uid and vid comes out in
> the result
>
> what's returned by edge list? edgeless G, E
> can now port NW graph algorithms as interface is very similar
>
> SG14 at cppcon?
>
>
>
>>
>> P1709R3:
>>
>> https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing
>>
>>
>> https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing
>>
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html>
>>
>> <
>>
>> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
>> *>*
>>
>> Array copy semantics:
>> array copy-semantics paper P1997 "Relaxing Restrictions on Arrays",
>> https://wg21.link/p1997
>>
>> Stats feedback:
>>
>> P2376R0
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf>
>> Comments
>> on Simple Statistical Functions (p1708r4): Contracts, Exceptions and
>> Special cases Johan Lundberg
>>
>
> More simple stats: added missing stats: median and mode because they are
> more involved
> weighted percentile, may not have weighted variant of this
> looked at python which has bivariate values
> might try to extend what we have to support these multivariate stats to be
> on par with python
> prediction needs regression
> return a start and end iterator
> JM: template argument of subrange can be omitted as it is defaulted
> what if looking for n modes in n range: allow user to specify how many
> modes
> JM: why do those 2 ranges need to be same type: value type needs to be
> friends; yes will make separate
> might also need constraints on relationship of value type and allow
> arithmetic
> dof is passed 1 and it will subtract just like python
>
> look at newer ranges algo do
>
> accumulate might need a zipview if precondition has the same length
>
> instead of univariate, bivariate we can condense that down to one
>
> range end iterator is always exclusive : it points to one past the last
> thing and not second element
> mode is sorted
>
>
>
>
>>
>> 2.2.1.2 Reinforcement Learning Larry Lewis Jorge Silva
>>
>> Reinforcement Learning proposal:
>>
>> 2.2.1.3 Differential Calculus:
>>
>>
>> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
>>
>> 2.2.1.4: Stats paper
>>
>> Current github
>>
>> https://github.com/cplusplus/papers/issues/475
>>
>> https://github.com/cplusplus/papers/issues/979
>>
>> Stats review Richard Dosselman et al
>>
>> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf
>>
>> Feedback from Johan Lundberg and Oleksandr Korval
>>
>> https://isocpp.org/files/papers/D2376R0.pdf
>>
>> P1708R3: Math proposal for Machine Learning: 3rd review
>>
>> PXXXX: combinatorics: 1st Review
>>
>> *> std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
>> <http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2>*
>> *> above is the stats paper that was reviewed in Prague*
>> *> http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
>> <http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19>*
>> *>*
>> *> Review Jolanta Polish feedback.*
>> *> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html>*
>>
>>
>> 2.2.1.4: Matrix paper
>>
>> 2.2.3 any other proposal for reviews?
>>
>> 2.3 Other Papers and proposals
>>
>> P1416R1: SG19 - Linear Algebra for Data Science and Machine Learning
>>
>> https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit#heading=h.tj9hitg7dbtr
>>
>> P1415: Machine Learning Layered list
>>
>> https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit#heading=h.tj9hitg7dbtr
>>
>> 2.2.2 SG14 Linear Algebra progress:
>> Different layers of proposal
>>
>> https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit
>>
>> 2.5 Future F2F meetings:
>>
>> 2.6 future C++ Standard meetings:
>> https://isocpp.org/std/meetings-and-participation/upcoming-meetings
>>
>> None
>>
>> 3. Any other business
>>
>> New reflector
>>
>> http://lists.isocpp.org/mailman/listinfo.cgi/sg19
>>
>> Old Reflector
>> https://groups.google.com/a/isocpp.org/forum/#!newtopic/sg19
>> <https://groups.google.com/a/isocpp.org/forum/?fromgroups=#!forum/sg14>
>>
>> Code and proposal Staging area
>>
>> 4. Review
>>
>> 4.1 Review and approve resolutions and issues [e.g., changes to SG's
>> working draft]
>>
>> 4.2 Review action items (5 min)
>>
>> 5. Closing process
>>
>> 5.1 Establish next agenda
>>
>>
>> 5.2 Future meeting
>>
>>
>>
>>
>> May 12, 2022 02:00 PM ET: Stats
>> June 9, 2022 02:00 PM ET: Graph
>> Jul 14, 2022 02:00 PM ET: Matrix, RL and DC
>> Aug 11, 2022 02:00 PM ET: Stats
>> Sep 13, 2022 02:00 PM ET: Graph
>> Oct 12, 2022 02:00 PM ET: Matrix RL/DC
>>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
>
in advance such that I ask Jon not to schedule my talk(s) the same day.
Thanks!
Le ven. 10 juin 2022 à 11:44, Michael Wong via SG19 <sg19_at_[hidden]>
a écrit :
>
>
> On Wed, Jun 8, 2022 at 3:15 PM Michael Wong <fraggamuffin_at_[hidden]>
> wrote:
>
>> Hi all, SG19 Machine Learning meeting will focus on graphs. Michael Wong
>> is inviting you to a scheduled Zoom meeting.
>>
>> Topic: SG19 monthly
>> Time: 02:00 PM Eastern Time (US and Canada)
>> Every month on the Second Thu,
>>
>>
>> Join from PC, Mac, Linux, iOS or Android:
>>
>> https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09
>> Password: 035530
>>
>> Or iPhone one-tap :
>> US: +13017158592,,93084591725# or +13126266799,,93084591725#
>> Or Telephone:
>> Dial(for higher quality, dial a number based on your current
>> location):
>> US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1
>> 408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782
>> or 877 853 5247 (Toll Free)
>> Meeting ID: 930 8459 1725
>> Password: 035530
>> International numbers available: https://iso.zoom.us/u/agewu4X97
>>
>> Or Skype for Business (Lync):
>> https://iso.zoom.us/skype/93084591725
>>
>> Agenda:
>>
>> 1. Opening and introductions
>>
>> The ISO Code of conduct:
>> https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf
>>
>> IEC Code of Conduct:
>>
>> https://www.iec.ch/basecamp/iec-code-conduct-technical-work
>>
>> ISO patent policy.
>>
>>
>> https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2
>>
>> The WG21 Practices and Procedures and Code of Conduct:
>>
>> https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures
>>
>> 1.1 Roll call of participants
>>
>
>
>> Chris Ryan, Jens Maurer, Kevin Dewesee, Ozan Irsoy, Phil Ratzloff, Rene
>> Rivera, Richard Dosselment, Scott McMillan, MIchael Wong, ka ming chan,
>> Will wray
>>
>> 1.2 Adopt agenda
>>
>> 1.3 Approve minutes from previous meeting, and approve publishing
>> previously approved minutes to ISOCPP.org
>>
>> 1.4 Action items from previous meetings
>>
>> 2. Main issues (125 min)
>>
>> 2.1 General logistics
>>
>> Meeting plan, focus on one paper per meeting but does not preclude other
>> paper updates:
>>
>>
>>
>> June 9, 2022 02:00 PM ET: Graph
>> Jul 14, 2022 02:00 PM ET: Matrix, RL and DC
>> Aug 11, 2022 02:00 PM ET: Stats
>> Sep 13, 2022 02:00 PM ET: Graph
>> Oct 12, 2022 02:00 PM ET: Matrix RL/DC
>>
>> ISO meeting status
>>
>> future C++ Std meetings
>>
> https://cppcon.org/cfs2022/ The submissions deadline is June 24th,
> with decisions sent by July 31st.
>
>
>>
>>
>> 2.2 Paper reviews
>>
>> 2.2.1: ML topics
>>
>> 2.2.1.1 Graph Proposal Phil Ratsloff et al
>>
>> Latest paper:
>>
>> Here’s a link to the paper (different than the previous paper reviewed).
>> There are some additional updates I’m planning on making before the
>> meeting.
>>
>>
>> https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing
>>
>>
>> edgeless view
> 2nd set of functions are for edges on a specific vertex
> not supporting due to pairing down so it is returning incoming edges as
> well
> neighbors now instead of adjacency and get source_id and target_id
> undirected incidence graph
> concept bounds polymorphism on an algo, or like an abstract base class:
> the undirected incidence and directed incidence graph, the algo used should
> be well defined - when algo gets target_id, in an undirected graph, it goes
> to a specific value which is well-defined, but the physical storage can be
> element 0 source, and 1 is the target for directed graph, but undirected
> element 0 or 1 could be source or target
>
> undirected graph needs a source-incidence graph (both a source and target
> id on an edge), directed vs undirected through emulation?
> do we need to store source id?
> undirected edge value
> undirected graph needs a source and target since we need to know where we
> came from
>
> different names for directed vs undirected or should be unordered on the
> edge
> terminology should reflect the math
> better term? unordered edge/ vertices, as long as uid and vid comes out in
> the result
>
> what's returned by edge list? edgeless G, E
> can now port NW graph algorithms as interface is very similar
>
> SG14 at cppcon?
>
>
>
>>
>> P1709R3:
>>
>> https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing
>>
>>
>> https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing
>>
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html>
>>
>> <
>>
>> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
>> *>*
>>
>> Array copy semantics:
>> array copy-semantics paper P1997 "Relaxing Restrictions on Arrays",
>> https://wg21.link/p1997
>>
>> Stats feedback:
>>
>> P2376R0
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf>
>> Comments
>> on Simple Statistical Functions (p1708r4): Contracts, Exceptions and
>> Special cases Johan Lundberg
>>
>
> More simple stats: added missing stats: median and mode because they are
> more involved
> weighted percentile, may not have weighted variant of this
> looked at python which has bivariate values
> might try to extend what we have to support these multivariate stats to be
> on par with python
> prediction needs regression
> return a start and end iterator
> JM: template argument of subrange can be omitted as it is defaulted
> what if looking for n modes in n range: allow user to specify how many
> modes
> JM: why do those 2 ranges need to be same type: value type needs to be
> friends; yes will make separate
> might also need constraints on relationship of value type and allow
> arithmetic
> dof is passed 1 and it will subtract just like python
>
> look at newer ranges algo do
>
> accumulate might need a zipview if precondition has the same length
>
> instead of univariate, bivariate we can condense that down to one
>
> range end iterator is always exclusive : it points to one past the last
> thing and not second element
> mode is sorted
>
>
>
>
>>
>> 2.2.1.2 Reinforcement Learning Larry Lewis Jorge Silva
>>
>> Reinforcement Learning proposal:
>>
>> 2.2.1.3 Differential Calculus:
>>
>>
>> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
>>
>> 2.2.1.4: Stats paper
>>
>> Current github
>>
>> https://github.com/cplusplus/papers/issues/475
>>
>> https://github.com/cplusplus/papers/issues/979
>>
>> Stats review Richard Dosselman et al
>>
>> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf
>>
>> Feedback from Johan Lundberg and Oleksandr Korval
>>
>> https://isocpp.org/files/papers/D2376R0.pdf
>>
>> P1708R3: Math proposal for Machine Learning: 3rd review
>>
>> PXXXX: combinatorics: 1st Review
>>
>> *> std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
>> <http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2>*
>> *> above is the stats paper that was reviewed in Prague*
>> *> http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
>> <http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19>*
>> *>*
>> *> Review Jolanta Polish feedback.*
>> *> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
>> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html>*
>>
>>
>> 2.2.1.4: Matrix paper
>>
>> 2.2.3 any other proposal for reviews?
>>
>> 2.3 Other Papers and proposals
>>
>> P1416R1: SG19 - Linear Algebra for Data Science and Machine Learning
>>
>> https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit#heading=h.tj9hitg7dbtr
>>
>> P1415: Machine Learning Layered list
>>
>> https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit#heading=h.tj9hitg7dbtr
>>
>> 2.2.2 SG14 Linear Algebra progress:
>> Different layers of proposal
>>
>> https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit
>>
>> 2.5 Future F2F meetings:
>>
>> 2.6 future C++ Standard meetings:
>> https://isocpp.org/std/meetings-and-participation/upcoming-meetings
>>
>> None
>>
>> 3. Any other business
>>
>> New reflector
>>
>> http://lists.isocpp.org/mailman/listinfo.cgi/sg19
>>
>> Old Reflector
>> https://groups.google.com/a/isocpp.org/forum/#!newtopic/sg19
>> <https://groups.google.com/a/isocpp.org/forum/?fromgroups=#!forum/sg14>
>>
>> Code and proposal Staging area
>>
>> 4. Review
>>
>> 4.1 Review and approve resolutions and issues [e.g., changes to SG's
>> working draft]
>>
>> 4.2 Review action items (5 min)
>>
>> 5. Closing process
>>
>> 5.1 Establish next agenda
>>
>>
>> 5.2 Future meeting
>>
>>
>>
>>
>> May 12, 2022 02:00 PM ET: Stats
>> June 9, 2022 02:00 PM ET: Graph
>> Jul 14, 2022 02:00 PM ET: Matrix, RL and DC
>> Aug 11, 2022 02:00 PM ET: Stats
>> Sep 13, 2022 02:00 PM ET: Graph
>> Oct 12, 2022 02:00 PM ET: Matrix RL/DC
>>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
>
Received on 2022-06-10 22:31:50