Ravenis in the Product Management Tools Industry

Raven

The Seven Ravens

Once upon a midnight dreary, while I pondered, weak and weary, Over many a quaint and curious volume of forgotten lore— While I nodded, nearly napping, suddenly there came a tapping, As of some one gently rapping, rapping at my chamber door. “’Tis some visitor,” I muttered, “tapping at my chamber door— Only this and nothing more.” Ah, distinctly I remember it was in the bleak December; And each separate dying ember wrought its ghost upon the floor. Eagerly I wished the morrow;—vainly I had sought to borrow From my books surcease of sorrow—sorrow for the lost Lenore— For the rare and radiant maiden whom the angels name Lenore— Nameless for evermore. And the silken, sad, uncertain rustling of each purple curtain Thrilled me—filled me with fantastic terrors never felt before; So that now, to still the beating of my heart, I stood repeating “’Tis some visitor entreating entrance at my chamber door— Some late visitor entreating entrance at my chamber door;— This it is and nothing more.” Presently my soul grew stronger; hesitating then no longer, “Sir,” said I, “or Madam, truly your forgiveness I implore; But the fact is I was napping, and so gently you came rapping, And so faintly you came tapping, tapping at my chamber door, That I scarce was sure I heard you”—here I opened wide the door;— Darkness there and nothing more. Deep into that darkness peering, long I stood there wondering, fearing, Doubting, dreaming dreams no mortal ever dared to dream before; But the silence was unbroken, and the stillness gave no token, And the only word there spoken was the whispered word, “Lenore?” This I whispered, and an echo murmured back the word, “Lenore!”— Merely this and nothing more. Back into the chamber turning, all my soul within me burning, Soon again I heard a tapping somewhat louder than before. “Surely,” said I, “surely that is something at my window lattice; Let me see, then, what thereat is, and this mystery explore— Let my heart be still a moment and this mystery explore;— ’Tis the wind and nothing more!” Open here I flung the shutter, when, with many a flirt and flutter, In there stepped a stately Raven of the saintly days of yore; Not the least obeisance made he; not a minute stopped or stayed he; But, with mien of lord or lady, perched above my chamber door— Perched upon a bust of Pallas just above my chamber door— Perched, and sat, and nothing more. Then this ebony bird beguiling my sad fancy into smiling, By the grave and stern decorum of the countenance it wore, “Though thy crest be shorn and shaven, thou,” I said, “art sure no craven, Ghastly grim and ancient Raven wandering from the Nightly shore— Tell me what thy lordly name is on the Night’s Plutonian shore!” Quoth the Raven “Nevermore.” Much I marvelled this ungainly fowl to hear discourse so plainly, Though its answer little meaning—little relevancy bore; For we cannot help agreeing that no living human being Ever yet was blessed with seeing bird above his chamber door— Bird or beast upon the sculptured bust above his chamber door, With such name as “Nevermore.” But the Raven, sitting lonely on the placid bust, spoke only That one word, as if his soul in that one word he did outpour. Nothing farther then he uttered—not a feather then he fluttered— Till I scarcely more than muttered “Other friends have flown before— On the morrow will leave me, as my Hopes have flown before.” Then the bird said “Nevermore.” Startled at the stillness broken by reply so aptly spoken, “Doubtless,” said I, “what it utters is its only stock and store Caught from some unhappy master whom unmerciful Disaster Followed fast and followed faster till his songs one burden bore— Till the dirges of his Hope that melancholy burden bore Of ‘Never—nevermore’.” But the Raven still beguiling all my fancy into smiling, Straight I wheeled a cushioned seat in front of bird, and bust and door; Then, upon the velvet sinking, I betook myself to linking Fancy unto fancy, thinking what this ominous bird of yore— What this grim, ungainly, ghastly, gaunt, and ominous bird of yore Meant in croaking “Nevermore.” This I sat engaged in guessing, but no syllable expressing To the fowl whose fiery eyes now burned into my bosom’s core; This and more I sat divining, with my head at ease reclining On the cushion’s velvet lining that the lamp-light gloated o’er, But whose velvet-violet lining with the lamp-light gloating o’er, shall press, ah, nevermore! Then, methought, the air grew denser, perfumed from an unseen censer Swung by Seraphim whose foot-falls tinkled on the tufted floor. “Wretch,” I cried, “thy God hath lent thee—by these angels he hath sent thee Respite—respite and nepenthe from thy memories of Lenore; Quaff, oh quaff this kind nepenthe and forget this lost Lenore!” Quoth the Raven “Nevermore.” “Prophet!” said I, “thing of evil!—prophet still, if bird or devil!— Whether Tempter sent, or whether tempest tossed thee here ashore, Desolate yet all undaunted, on this desert land enchanted— On this home by Horror haunted—tell me truly, I implore— Is there— there balm in Gilead?—tell me—tell me, I implore!” Quoth the Raven “Nevermore.” “Prophet!” said I, “thing of evil!—prophet still, if bird or devil! By that Heaven that bends above us—by that God we both adore— Tell this soul with sorrow laden if, within the distant Aidenn, It shall clasp a sainted maiden whom the angels name Lenore— Clasp a rare and radiant maiden whom the angels name Lenore.” Quoth the Raven “Nevermore.” “Be that word our sign of parting, bird or fiend!” I shrieked, upstarting— “Get thee back into the tempest and the Night’s Plutonian shore! Leave no black plume as a token of that lie thy soul hath spoken! Leave my loneliness unbroken!—quit the bust above my door! Take thy beak from out my heart, and take thy form from off my door!” Quoth the Raven “Nevermore.” And the Raven, never flitting, still is sitting, is sitting On the pallid bust of Pallas just above my chamber door; And his eyes have all the seeming of a demon’s that is dreaming, And the lamp-light o’er him streaming throws his shadow on the floor; And my soul from out that shadow that lies floating on the floor Shall be lifted—nevermore! here he She is still

The Raven (January 1845)

The Raven is a highly symbolic creature that is mentioned in a variety of cultures with varied purposes . One of the meanings is that of transformation. As Ravencoin is a fork of the Bitcoin code it could very well be this meaning that the developers wanted to express. It is with this imagery that we introduce . Ravencoin is a new project that was announced on October 31st, 2017 and debuted on Bitcoin’s 9th birthday on January 3rd, 2018 with the release of software for mining. Ravencoin is more than a fork of the Bitcoin code it is a project that builds upon the original vision of Bitcoin but with added new features which extend the functionality and the intrinsic value of the coin organically. Ravencoin Improved bitcoin built for assets Ravencoin: Clone of bitcoin that will be used for assets. Ravencoin is a free open source platform designed for the specific use case of transferring assets such as token-backed assets from one holder to another. While it may seem that with the development of the great blockchains such as Bitcoin and Ethereum, transferring assets between different parties is already a solved issue, it is not exactly the case. Neither Bitcoin nor Ethereum were specifically designed for facilitating ownership of additional assets, do to the fact that they simply focused their attention in other features. Ravencoin is built on a fork of the Bitcoin code. It has been implemented with a smaller block reward of one minute (the block reward is the only way that new coins are created and it is an incentive for miners to add hash power to the network), and the addition of asset creation and message capabilities. If you are a , and we are sure you are because you are reading this right now. You will agree that blockchain tech will indeed change global economic paradigm as we know it nowadays. crypto-lover However being able to send wealth transactions in a matter of seconds, internationally and with no third parties involved, is just the tip of the iceberg that this new revolution represents. In the same path of unstoppable evolution, Ravencoin will implement the way assets owners operate with their wells. It will allow them to handle efficiently the transfer of their assets to another parties. To live this world order revolution without losing any keypoint: Problem Despite the success and widespread adoption of Bitcoin and Ethereum, neither of these blockchains have been specifically designed to facilitate the ownership of additional assets on top of the tokens that are transacted throughout their respective networks. In Bitcoin, the original rules governing the blockchain and protocol must be adhered to and so this means that Bitcoin nodes are not able to register that assets are being embedded into tokens. This means that for every asset transaction made on the Bitcoin network, there must be an accompanying bitcoin transaction fee, even if the transaction is to simply send the asset. This has a result of unnecessary transaction fees whenever assets are transferred. Additionally, the other major disadvantage is that assets can easily be ‘destroyed’ if they are sent to an exchange or wallet. For Ethereum the network is not able to natively recognize smart contract tokens and this can cause some confusion due to multiple ERC20 tokens with identical names. The only distinguishing factor between contracts with identical names is the contract hash and this can confuse users or be used with malicious intent to scam others. As Ravencoin will be running on a decentralized model with independent miners to support the stability of the blockchain combined with ASIS-resistance the coin will have a good chance of staying in the hands of individuals and not centralized by one party or a group of parties that can collude to shape the outcome of an event, a vote or even the price of the coin itself. Peer to Peer Electronic System for the Creation and Transfer of Assets Optimized for transferring assets Tokens offer several advantages to traditional shares or other participation mechanisms: faster transfer speeds, increased user control, and censorship resistance, and a reduction or elimination of the need for a trusted third party. Solution The solution to the above issues is to create a Bitcoin-like system that is completely asset aware so that it recognizes when tokens have been designed as assets. With a view to solve the problem, Ravencoin will bring to life the said: “Keep it simple stupid” by focusing on creating one thing, just one specific thing… a bitcoin-like system , totally aware about when tokens are designed as assets (Based on PoW but with a new mining algorithm, x16r). This provides three advantages: Assets can be protected from accidentally being destroyed. As the protocol and the system is aware of the assets — they can be carried on the blockchain like a passenger on the train eventually getting them all safely to the destination. Users are able to issue, track, and transfer assets with each other with the ease of sending a message to one another. Now users will relay on a full platform specifically designed to issue, track and transfer assets between parties. It will provide proper security levels to the underlying assets. To do that Ravencoin will depend on a wide distribution, a strong mining community and market value to function. Main Features — Tech Overview Ok, now we understand the problem (the proposed one, between the many existing issues) that needs to be solved in current blockchain and we know the solution that Ravencoin is committed to develop in order to transcend that limitation. So… whats next?. We need to go deep into their tech… it seems boring, but we will take care of that. Only in that way we will really have knowledge and foundations to take decisions about the project. Ravencoin bring us the following features: X16R Algorithm Before we describe what X16R is we will first provide details behind what other coins have implemented for their algorithms. In the search to create and implement algorithms that are ASIC resistant (meaning that purpose built mining machines with high hash rates could not be developed) which in turn reduces the chances of centralization via large mining farms, projects have tried a variety of tactics to hinder this centralization (like we see with Bitcoin mining). The first approach was to adopt memory intensive algorithms like those used by both Scrypt and Equihash. This requirement for additional in memory calculations reduces the performance of the ASIC to more onpar of the GPU based mining with the same algorithm Another approach that was undertaken, was Dash’s approach, which was to adopt the X11 algorithm. This is the use of 11 chained hashing algorithms (hence the name) in an effort to slow down the creation of ASIC hardware. This did not prevent the design of a special purpose ASIC so once there was an ASIC for X11, others added more hashing algorithms to create additional algorithms that were named X13, X15 and X17. This makes it more difficult to create an ASIC but because the algorithms are in roughly the same order its difficult but not impossible to create an ASIC. What Ravecoin is doing is called X16r and that implementation like the others described previously use 16 algorithms for the hashing (see table below). The key difference is they have added algorithm reordering. It is this reordering based on the results from the previous block that provides more ASIC resistance than other hashing algorithms. Example: 0000000000000000007e8a29f052ac2870045ae3970270f9​7da00919b8e86287 Previous Block Hash: ​0x7da00919b8e86287 determines what the next 16 hashes should be. The final 8 bytes: Roadmap Phase 1 — Complete Ravencoin (RVN) is a Proof of Work coin built on the Bitcoin UTXO model. As with other Bitcoin derivatives, RVN coins are distributed to persons augmenting the Raven network by mining Raven. x1000 coin distribution (21 Billion Total) 10x faster blocks (1 per minute) In app CPU mining ~1.4 Day difficulty adjustment (2016 blocks) Addresses start with R… for regular addresses, or r… for multisig Network Port: 8767 RPC Port: 8766 UTXO — UNSPENT TRANSACTION OUTPUT DEFINITION The Unspent Transaction Output is key to bitcoin as this is how bitcoin keeps track of inputs and outputs on the blockchain. First let’s look at how a bank works. Assume Tom is with Bank A and has a balance of $5,000 and assume that Alice who does all her banking with Bank B has no balance. Tom wants to send $2,000 dollars to Alice. To do this Tom asks his bank to send $2,000 to Bank B in Alice’s name. The actual transaction has Tom’s balance reduced by $2,000 from $5,000 to $3,000 and Alice’s balance increases from $0 to $2,000. Taking this to the Bitcoin blockchain: Tom has received inputs in the amount of 5 BTC. This is from 4 transactions (inputs) INPUTS Received 2 BTC Received 1 BTC = 5 BTC Received 1.5 BTC Received .5 BTC In this example, Tom wants to send Alice 2 BTC. The blockchain, unlike banks, is not aware of balances as in the example above so the transaction is recorded as : OUTPUTS 2 BTC sent to Alice 3 BTC sent back to Tom → this is the Unspent Transaction Output or UTXO Phase 2 — Assets (in progress)ASIC RESISTANCE ASIC Resistance — A published commitment to continual attempts at ASIC resistance. If ASICs are created for x16r, then we will, at a specific block number, modify one of the algorithms to add Equihash, EthHash or similar efforts to increase the resistance to ASIC miners for Raven. UNIQUE ASSET SUPPORT Ravencoin will be a hard fork that extends Raven to include the ability to issue and transfer assets. The expected release of asset capabilities will be approximately seven months after the release of RVN. Raven will be extended to allow issuing, reissuing, and transfer of assets. Assets can be reissuable or limited to a set supply at the point of issuance. The cost to create assets will be 500 RVN to create any qty of an asset. Each asset name must be unique. Asset names will be limited to A-Z and 0–9, ‘ ‘ cannot be the first, or the last character, or be consecutive. ‘ and ‘.’ and must be at least three characters long. The ‘.’ and the ‘ Examples of valid assets: THE_GAME A.TOKEN 123 Examples of invalid assets: (consecutive punctuation) _TOKEN THEEND. A..B AB 12 .FIRST The RVN used to issue assets will be sent to a burn address, which will reduce the amount of RVN available. Asset transfers require the standard RVN transaction fees for transfer from one address to another. METADATA Metadata about the token can be stored in IPFS. Initially this cannot be changed. If there is a demand, the system can be updated to allow updating the metadata by the token issuer. REWARDS Reward capabilities will be added to allow payment (in RVN) to all holders of an asset. Payments of RVN would be distributed to all asset holders pro rata. This is useful for paying dividends, dividing payments, or rewarding a group of token holders. Example: A small software company issues an asset GAMECO that represents a share of the project. GAMECO tokens can be traded with others. Once the software company profits, those profits can be distributed to all holders of GAMECO by sending the profits (via RVN) to all holders of GAMECO. BLOCK SIZE Raven may increase the blocksize from 1 MB to X MB to allow for more on-chain transactions. Phase 3 — Rewards The reward system will allow for the creation of tokens that sit on the Raven blockchain. These tokens can be created and then sent to people as a reward for doing something or as a way to raise funds. The funds raised can then be used to send any currency on the raven blockchain to another party. Phase 4 — Unique Assets Once created, assets can be made unique for a cost of 5 RVN. Only non-divisible assets can be made unique. This moves an asset to a UTXO and associates a unique identifier with the txid. From this point the asset can be moved from one address to another and can be traced back to its origin. Only the issuer of the original asset can make an asset unique. The costs to make unique assets will be sent to a burn address. Some examples of unique assets: Imagine that an art dealer issues the asset named ART. The dealer can then make unique ART assets by attaching a name or a serialized number to each piece of art. These unique tokens can be transferred to the new owner along with the artwork as a proof of authenticity. The tokens ART:MonaLisa and ART:VenusDeMilo are not fungible and represent distinct pieces of art. A software developer can issue the asset with the name of their software ABCGAME, and then assign each ABCGAME token a unique id or license key. The game tokens could be transferred as the license transfers. Each token ABCGAME:398222 and ABCGAME: are unique tokens. In game assets. A game ZYX_GAME could create unique limited edition in-game assets that are owned and used by the game player. Example: ZYX_GAME:Sword005 and ZYX_GAME:Purse RVN based unique assets can be tied to real world assets. Create an asset named GOLDVAULT. Each gold coin or gold bar in a vault can be serialized and audited. Associated unique assets GOLDVAULT:444322 and GOLDVAULT:555994 can be created to represent the specific assets in the physical gold vault. The public nature of the chain allows for full transparency. Phase 5 — Messaging Messaging to token holders by authorized senders will be layered on top of the Phase 3 unique assets. See KAAAWWW Protocol for additional information. Phase 6 — Voting Voting will be accomplished by creating and distributing parallel tokens to token holders. These tokens can be sent to RVN addresses to record a vote. Team + Advisors Dubbed a community coin. Anyone can contribute and add to the project. The number of developers involved is uncertain, however there were 430 Bitcoin developers who made over 14,000 commits according to Github. — Tron Black Core Developer Tron has been in Blockchain & cryptocurrencies as a Software Developer for 5+ years. Currently a Principal Software Developer for Medici a VC investing in the blockchain space. His career mission is to enhance technology to solve real world problems. He was the President/CEO at Blue Squirrel for 17+ years. Blue Squirrel is a software development company their original product was SQURL, it was the google of the internet at the time. Created Paten — System to Verify Identity and Reputation for a Cryptocurrency Wallet Address : Patent dateFiled June 6, 2013 Patent issuer and numberus 61831802. Patent descriptionMethod and system for voluntary identification of a corporate or individual identity to public crypto-currency address(es), and a single digit reputation rating system accessible through API. — Bruce Fenton Advisor Bruce is a Blockchain Economic Advisor. He has had 23+ years of experience in the Finance sector and combined with 3+ years experience in the blockchain and cryptocurrency space. He has placed over $5 billion in investments in investing funds during his career. Advised the Bill & Melinda Gates Foundation — arranged, attended and staffed very senior level meetings between Bill Gates and business and government leaders in Saudi Arabia, worked with the Head of Middle East for the foundation (please note, opinions on digital money and economic issues are not that of the foundation). Hosted the Satoshi Roundtable private retreat, a gathering of 75 of the top leaders in blockchain technology. Angel Investor in SpeechWorks (now publicly traded Nuance with $5bn market cap). Angel Investor in Bitcoin companies such as ShapeShift. Advisor to Factom, BTCS and other companies. Currently hold 3 roles: Board Member of The Bitcoin Foundation (2+ years), which is the largest and oldest industry group for Bitcoin Technology. Founder at Satoshi Roundtable Private Blockchain Retreat (3+ years), which is a invite only VIP annual event. Managing Director. CIO for atlantic Financial Inc. (23+) Partners and Investors Contributing Companies: Additonal Resources: Cointelegraph News Article SeekinAlpha Article BitcoinMagazine Article CryptoCoinSpy Article For the best in news, reviews, and information for the blockchain and cryptocurrency visit or check us out on: | | | coincrunch.io Youtube Twitter Facebook Reddit

Ravencoin Review — A Bitcoin Code Fork Looking to Bring Real-World Assets onto Blockchain

Loss of Amazon Rainforest Resilience: Author Contributions

This is paper is available on arxiv under CC 4.0 DEED license. Authors: (1) Leah Chrestien, Czech Technical University in Prague; (2) Tomá˘s Pevný, Czech Technical University in Prague, and Gen Digital, Inc.; (3) Stefan Edelkamp, Czech Technical University in Prague; (4) Antonín Komenda, Czech Technical University in Prague. Table of Links Abstract & Introduction Preliminaries Conditions on strictly optimally efficient heuristic Loss functions Related Work Experiments Conclusion and References Appendix 7 Conclusion The motivation of this paper stemmed from the observation that even the cost-to-goal, considered to be an optimal heuristic, fails to guarantee a strictly optimally efficient search. Since a large body of existing research optimizes this quantity, we are effectively lost with respect to what should be optimized. To fill this gap, we have stated the necessary and sufficient conditions guaranteeing the forward search to be strictly optimally efficient. These conditions show that the absolute value of the heuristic is not important, but that the ranking of states in the Open list is what controls the efficiency. Ranking can be optimized by minimizing the ranking loss functions, but its concrete implementation needs to correspond to a variant of the forward search. In case of mismatch, the resulting heuristic can perform poorly, which has been demonstrated when the heuristic optimized for BGFS search was used with A* search. The other benefit of ranking losses is that from the point of view of statistical learning theory, they solve a simpler problem than ubiquitous regression in estimating the cost-to-goal. We do not question the existence of a strictly optimally efficient heuristic. Given our experiments, we believe that if the space of heuristic functions over which the loss is optimized is sufficiently rich, the result will be sufficiently close to the optimal for the needs of the search. 7.1 Acknowledgements This work has been supported by project numbers 22-32620S and 22-30043S from Czech Science Foundation and OP VVV project CZ.02.1.01/0.0/0.0/16_019/0000765 "Research Center for Informatics". This work has also received funding from the European Union’s Horizon Europe Research and Innovation program under the grant agreement TUPLES No 101070149. References [1] Forest Agostinelli, Stephen McAleer, Alexander Shmakov, and Pierre Baldi. Solving the rubik’s cube with deep reinforcement learning and search. Nature Machine Intelligence, 1(8):356–363, 2019. [2] Thomas Anthony, Zheng Tian, and David Barber. Thinking fast and slow with deep learning and tree search. In Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett, editors, Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pages 5360–5370, 2017. [3] Shahab Jabbari Arfaee, Sandra Zilles, and Robert C Holte. Learning heuristic functions for large state spaces. Artificial Intelligence, 175(16-17):2075–2098, 2011. [4] Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah. Julia: A fresh approach to numerical computing. SIAM review, 59(1):65–98, 2017. [5] Mohak Bhardwaj, Sanjiban Choudhury, and Sebastian Scherer. Learning heuristic search via imitation. In Conference on Robot Learning, pages 271–280. PMLR, 2017. [6] Blai Bonet and Héctor Geffner. Planning as heuristic search. Artificial Intelligence. 2001 Jun; 129 (1-2): 5-33., 2001. [7] Vladimir Cherkassky, Xuhui Shao, Filip M Mulier, and Vladimir N Vapnik. Model complexity control for regression using vc generalization bounds. IEEE transactions on Neural Networks, 10(5):1075–1089, 1999. [8] Leah Chrestien, Tomáš Pevný, Antonín Komenda, and Stefan Edelkamp. Heuristic search planning with deep neural network using imitation, attention and curriculum learning. In PRLIJCAI workshop, 2021. [9] Lukás Chrpa. Combining learning techniques for classical planning: Macro-operators and entanglements. In ICTAI, pages 79–86. IEEE Computer Society, 2010. [10] Rina Dechter and Judea Pearl. The optimality of A* revisited. In Michael R. Genesereth, editor, AAAI, pages 95–99. AAAI Press, 1983. [11] Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959. [12] Stefan Edelkamp. Automated creation of pattern database search heuristics. In Model Checking and Artificial Intelligence, pages 35–50, 2006. [13] Stefan Edelkamp and Stefan Schrödl. Heuristic Search - Theory and Applications. Academic Press, 2012. [14] Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, and Zhifu Zhang. Inconsistent heuristics in theory and practice. Artificial Intelligence, 175(9):1570–1603, 2011. [15] Dieqiao Feng, Carla P. Gomes, and Bart Selman. Solving hard AI planning instances using curriculum-driven deep reinforcement learning. In Christian Bessiere, editor, Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pages 2198–2205. ijcai.org, 2020. [16] Patrick Ferber, Malte Helmert, and Jörg Hoffmann. Neural network heuristics for classical planning: A study of hyperparameter space. In ECAI, pages 2346–2353. IOS Press, 2020. [17] Santiago Franco, Álvaro Torralba, Levi H. S. Lelis, and Mike Barley. On creating complementary pattern databases. In IJCAI, pages 4302–4309, 2017. [18] Caelan Reed Garrett, Leslie Pack Kaelbling, and Tomás Lozano-Pérez. Learning to rank for synthesizing planning heuristics. page 3089–3095, 2016. [19] Edward Groshev, Aviv Tamar, Maxwell Goldstein, Siddharth Srivastava, and Pieter Abbeel. Learning generalized reactive policies using deep neural networks. 2018. [20] Arthur Guez, Théophane Weber, Ioannis Antonoglou, Karen Simonyan, Oriol Vinyals, Daan Wierstra, Rémi Munos, and David Silver. Learning to search with mctsnets. In International conference on machine learning, pages 1822–1831. PMLR, 2018. [21] Peter E Hart, Nils J Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4(2):100–107, 1968. [22] Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, and Sven Koenig. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI, pages 1007–1012, 2007. [23] Malte Helmert and Gabriele Röger. How good is almost perfect? In AAAI, pages 944–949. AAAI Press, 2008. [24] Robert C. Holte and Sandra Zilles. On the optimal efficiency of cost-algebraic A. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pages 2288–2295. AAAI Press, 2019. [25] Michael Katz, Shirin Sohrabi, Horst Samulowitz, and Silvan Sievers. Delfi: Online planner selection for cost-optimal planning. IPC-9 planner abstracts, pages 57–64, 2018. [26] Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv:1412.6980, 2014. [27] Donald E Knuth and Ronald W Moore. An analysis of alpha-beta pruning. Artificial intelligence, 6(4):293–326, 1975. [28] Richard E. Korf. Iterative-deepening-A*: An optimal admissible tree search. In IJCAI, pages 1034–1036. Morgan Kaufmann, 1985. [29] Richard E Korf. Macro-operators: A weak method for learning. Artificial intelligence, 26(1):35–77, 1985. [30] Šimon Mandlík, Matej Ra ˇ cinsk ˇ y, Viliam Lis ` y, and Tomáš Pevn ` y. Jsongrinder. jl: automated ` differentiable neural architecture for embedding arbitrary json data. Journal of Machine Learning Research, 23(298):1–5, 2022. [31] Drew V. McDermott. A heuristic estimator for means-ends analysis in planning. In AIPS, pages 142–149. AAAI, 1996. [32] David Ménager, Dongkyu Choi, Mark Roberts, and David W. Aha. Learning planning operators from episodic traces. In 2018 AAAI Spring Symposia. AAAI Press, 2018. [33] Ionut Moraru, Stefan Edelkamp, Santiago Franco, and Moisés Martínez. Simplifying automated pattern selection for planning with symbolic pattern databases. In KI, pages 249–263, 2019. [34] Christian Muise. Collection of pddl files of classical problems. https://github.com/AI-Planning/classical-domains, 2023. [35] XuanLong Nguyen, Martin J Wainwright, and Michael I Jordan. On surrogate loss functions and f-divergences. The Annals of Statistics, pages 876–904, 2009. [36] Laurent Orseau, Levi Lelis, Tor Lattimore, and Théophane Weber. Single-agent policy tree search with guarantees. Advances in Neural Information Processing Systems, 31, 2018. [37] Laurent Orseau and Levi HS Lelis. Implementation of the algorithms described in "policyguided heuristic search with guarantees" by l. orseau and l. lelis, published at aaai’21. https://github.com/levilelis/h-levin, 2021. [38] Laurent Orseau and Levi HS Lelis. Policy-guided heuristic search with guarantees. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 12382–12390, 2021. [39] Arthur L Samuel. Some studies in machine learning using the game of checkers. ii—recent progress. IBM Journal of research and development, 11(6):601–617, 1967. [40] Max-Philipp B. Schrader. gym-sokoban. https://github.com/mpSchrader/gym-sokoban, 2018. [41] Jendrik Seipp, Florian Pommerening, and Malte Helmert. New optimization functions for potential heuristics. In ICAPS, 2015. [42] Jendrik Seipp and Silvan Sievers. Fast downward stone soup 2023. [43] Jendrik Seipp, Álvaro Torralba, and Jörg Hoffmann. PDDL generators. https://doi.org/10.5281/zenodo.6382173, 2022. [44] William Shen. Strips-hgn. https://github.com/williamshen-nz/STRIPS-HGN, 2021. [45] William Shen, Felipe Trevizan, and Sylvie Thiébaux. Learning domain-independent planning heuristics with hypergraph networks. In ICAPS, volume 30, pages 574–584, 2020. [46] David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, et al. Mastering the game of go without human knowledge. nature, 550(7676):354–359, 2017. [47] Kristian Smith. Maze creator / solver. https://github.com/ravenkls/Maze-Generator-and Solver, 2022. [48] Gustav Sourek, Vojtech Aschenbrenner, Filip Zelezny, Steven Schockaert, and Ondrej Kuzelka. Lifted relational neural networks: Efficient learning of latent relational structures. Journal of Artificial Intelligence Research, 62:69–100, 2018. [49] Simon Ståhlberg, Blai Bonet, and Hector Geffner. Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits. In Akshat Kumar, Sylvie Thiébaux, Pradeep Varakantham, and William Yeoh, editors, Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (virtual), June 13-24, 2022, pages 629–637. AAAI Press, 2022. [50] Ingo Steinwart. Consistency of support vector machines and other regularized kernel classifiers. IEEE transactions on information theory, 51(1):128–142, 2005. [51] Takeshi Takahashi, He Sun, Dong Tian, and Yebin Wang. Learning heuristic functions for mobile robot path planning using deep neural networks. In ICAPS, volume 29, pages 764–772, 2019. [52] Alvaro Torralba, Vidal Alcázar, Daniel Borrajo, Peter Kissmann, and Stefan Edelkamp. SymBA*: A symbolic bidirectional A* planner. In International Planning Competition, pages 105–108, 2014. [53] Sam Toyer, Sylvie Thiébaux, Felipe Trevizan, and Lexing Xie. Asnets: Deep learning for generalised planning. Journal of Artificial Intelligence Research, 68:1–68, 2020. [54] Vladimir Vapnik. Principles of risk minimization for learning theory. Advances in neural information processing systems, 4, 1991. [55] Marin Vlastelica, Michal Rolinek, and Georg Martius. Neuro-algorithmic policies enable fast combinatorial generalization. In International Conference on Machine Learning, pages 10575– 10585. PMLR, 2021. [56] Xuemei Wang. Learning planning operators by observation and practice. In Kristian J. Hammond, editor, AIPS, pages 335–340. AAAI, 1994. [57] Christopher Wilt and Wheeler Ruml. When does weighted A* fail? In International Symposium on Combinatorial Search, volume 3, 2012. [58] Christopher Makoto Wilt and Wheeler Ruml. Effective heuristics for suboptimal best-first search. J. Artif. Intell. Res., 57:273–306, 2016. [59] Yuehua Xu, Alan Fern, and Sungwook Yoon. Learning linear ranking functions for beam search with application to planning. Journal of Machine Learning Research, 10(7), 2009. [60] Ryo Yonetani, Tatsunori Taniai, Mohammadamin Barekatain, Mai Nishimura, and Asako Kanezaki. Path planning using neural A* search. In International Conference on Machine Learning, pages 12029–12039. PMLR, 2021. [61] Ziqi Zhang and Florian Geißer. Extending graph neural networks for generalized stochastic planning. In Bridging the Gap Between AI Planning and Reinforcement Learning. 2021. [62] Tan Zhi-Xuan. PDDL. jl: An Extensible Interpreter and Compiler Interface for Fast and Flexible AI Planning. PhD thesis, Massachusetts Institute of Technology, 2022. [63] Juntang Zhuang, Tommy Tang, Yifan Ding, Sekhar C Tatikonda, Nicha Dvornek, Xenophon Papademetris, and James Duncan. Adabelief optimizer: Adapting stepsizes by the belief in observed gradients. Advances in neural information processing systems, 33:18795–18806, 2020.

Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Conclusion and References

Este artículo fue primeramente publicado en . +qL es #másqueley aka #másqueley es la firma hermana de aka #beyondthelaw. +qL holoLAWn If you have legal questions or want to debate, join our . Discord TL:DR The MetaLeX whitepaper aims to give birth to a new kind of law (the ) in order to complete the project of disconnecting the blockchain world from the world of flesh and blood. To free humans from the vertical hierarchy of institutional powers and return them to a space of freedom among equals, a of horizontal hierarchy. A project that to date has a currency and finance separate - in theory - from the state (Bitcoin and Ethereum as respective paradigms of cryptocurrencies and smart contracts that enable decentralised transactions and finance); but a project that lacks an equally separate law to govern that proto-world of a longed-for separate world, a free world. Autonomous Law heterotopia What you will (and won't) find here We are all looking for something. The : a spoiler. Autonomous Law The whitepaper: an interpretation (ours). Phase 1: BORGs. Phase 2: Deal Technology. Phase 3: . Autonomous Law Conflicts with a decentralised and autonomous dimension that are resolved by laws and legal operators that do not contemplate (or do not want to contemplate) decentralisation and autonomy. Conflicts with a decentralised and autonomous dimension that are solved by very cool alternative legal operators, at the time, by humans governed by their own will, . and nothing else Conflicts with a decentralised and autonomous dimension that are resolved by autonomous and decentralised laws that, as such, provide for decentralisation and autonomy. By way of (in)conclusion. ➡️ We are all looking for something We are all looking for something. Diogenes a righteous man in the streets of Athens, candle in hand; Ichabod Crane a kind truth behind the terrifying Headless Horseman; Indiana Jones the Lost Ark in an unbridled race against esoteric Nazis; Sebastian, between the black keys of a piano, the love lost through an infinite renunciation of love for his beloved Mia; and, finally, searches with his MetaLeX for an that will make a free world possible —almost nothing. Gabriel Shapiro Autonomus Law The : a spoiler ➡️ Autonomous Law The to which the devotes the bulk of its text —a third at least— is something like a new normative paradigm, a new kind of legal order that will allow humans to escape the clutches of nation states and their - and -national entanglements. Autonomous Law MetaLeX whitepaper supra infra And given the state of decadence and woke perversion of Western governments, of everything that sounds or resonates with Public Administration —and this is not an opinion: it is an easily verifiable empirical observation, a notorious fact in the technical-legal-proven sense—, it seems to me that the search for MetaLeX is an enterprise worth supporting —we, who still don't know how 😅, we're in! This that dazzles us: Autonomous Law is law because it aims to regulate (in part) human interaction; is decentralised because it will reside on a blockchain; it is ( ) because the blockchain, and everything that resides in it, is code; code code is law it is because, as the execution of code (with or without AI, but AI is also code, and only code - at least for the moment, until consciousness emerges...), it does not require human intervention, i.e. the self-execution of the code is the application of the law itself. autonomous And it is because the government and the legal decision by way of the law-code, at the time of the code, the , will be independent of the as well as of . Neither traditional law, nor the humans who create it, will have anything to say about the rule of code once it is born into the world of the blockchain. autonómica rule of code rule of law the rule of men This deserves clarification in order to escape sophistry. Just as the created cannot free itself from its creation, no law can free itself from the clutches of the man who creates it. Only the constituent law, which initiates a Legal Order, can (relatively) do so under the artifice of the by which it itself, and not its creator, sets itself up as the principle of everything. And, thus, under the impossible that the constituent law itself contains in itself the will to be constituted, as a normative , is that can make it seem as if it is born and we can make it seem as if it is so. legal fiction ouroboros it ➡️ The whitepaper: one interpretation (ours) If you page through the whitepaper, its first ten pages are an interesting introduction that operates as an extensive until, around page ten, we are presented with a sort of table of contents that corresponds to the three phases of logical and chronological development of the MetaLeX project to reach the . captatio benevolentiae Autonomous Law At this point, in these lines, we are not so much interested in how the Autonomous Law is arrived at, nor therefore in the phases, as in the concept of Autonomous Law itself. Moreover - it must be said - because the description of phases 1 and 2 is clear enough to get a good idea of what we are talking about, but not sufficiently detailed to know what the hell we are talking about beyond that idea. We can all get a good idea of what unicorns are from what we talk about them; but none of us can know exactly what the hell a unicorn is until we e.g. see it, tame it, ride it, feed it… From this point of view, we will summarise the phases, in our own style. ➡️➡️ Phase 1: BORGs Phase 1 essentially concerns the creation of blockchain programmes that apply rules in a community of users. fully autonomous In this sense, a law is ultimately a very special kind of rule that is distinguished from other rules by its origin: if the rule is dictated by the state, it is a law; if it is dictated by your father or mother, it is a precept of family behaviour; if it is dictated by a criminal gang, it is the code of a mafia. But for all these groups —state, family, mafia— the rule operates as law, whether it is called law, precept or code; in other words, the law, the precept and the code are functionally equivalent within the respective target community. So a programme on the blockchain that applies rules is, for the purposes of the community resident in the protocol where it is applied, its own law. Whether it is recognised as such outside that community —and this is, strictly speaking, the crux of the matter— is another matter. These programmes are called BORGs ( ) and are like sub-DaOs stripped down, fully autonomous from a parent DAO. Suppose a DAO requires six Fi functions to function. Some of these functions with the current state of the art are fully autonomous; others are not —and that is precisely why we have this mess of BORGs, to gradually implement, as technology makes it possible, the next phases. For each fully autonomous Fi function, a programme is created to implement it, a BORG. This is then like the DAO for the sole purpose of that particular fully autonomous function. Then, there will come a point where for every Fi function of the DAO there is a BORG that implements it. However, not even at that point will the DAO be, let us say, the conjunctive sum of all these BORGs: cyBernetic ORGanisationS {BORGi} ≢ DAO The DAO is an emergence from this set of BORGs, a something more. Just as a daisy is not reduced to the petals that have been shed along with the stem; nor is a company qua legal entity (with or without legal personality, it is not relevant here) the sum of its partners, or the sum of its departments, or the sum of its strategies, or the sum of its articles of association...; so it is not the case that the DAO we have been talking about is the sum of its BORGs. That “something else” which is the daisy or the society qua legal entity with respect to the component parts is a emergence just as the DAO is a mereological emergence of those BORGs. Which brings us headlong into the second phase. mereological ➡️➡️ Phase 2: Deal Technology For this set of BORGs -{BORGs} - to identify with the DAO, it is necessary for its elements to work in a coordinated manner. This will be achieved through a series of agreements between the BORGs that will then validate the identity: {BORGi} + TFA ≡ autDAO Where TFA = Technological Framework Agreement, a set of covenants that make the set of BORGs cease to be just that, a set of BORGs, and become an entity functionally equivalent to the DAO from which they were detached. Now, the final result will be so qualitatively different from the DAO that it will also be substantially different from it: it will be a true DAO (= autDAO) . That is: 2 the set of BORGs plus their TMA operates as a perfectly autonomous and autonomous version (autDAO) of the imperfect autonomous and autonomous DAO that gave birth to them. From this perspective, and as far as these two phases are concerned, it can be said that, at the end of the day, MetaLeX only aims to recover the pure sense of the DAO, a DAO that technological limitations and human praxis have turned decentralisation and autonomy into an absurdity, because I don't care whether the one at the top governs or the one next to him governs, if it is the case that the one at the top and the one next to him have exactly the same power. ➡️➡️ Phase 3: Autonomous Law Our autDAOs —well, those of MetaLeX, that is— as social entities that are also social entities, however much they reside in the blockchain, will interact with each other and with the world of flesh and blood; that interaction will generate conflict; and that conflict will have to be resolved. And this is —in our opinion— where the whitepaper puts its finger on the problem —we recommend reading it, in particular the headings and . We, here, present it as follows: Phase 3-Autonomus Law Conclusion ➡️➡️➡️ Conflicts with a decentralised and autonomous dimension that are resolved by laws and legal operators that do not (or do not want to) contemplate decentralisation and autonomy If these conflicts are resolved under the , state legal systems, also from above and from below), they will de facto nullify the essence of the underlying structures that have been so hard to create. rule of law , trying to explain the Kantian categories of time and space, that the world is seen through the lenses of the glasses you wear: if pink, then rose-coloured. This, which our grandparents used to tell us in other less refined but certainly more understandable ways, is as true as the sun. Warburton explained And so, if it is the case —and it is— that the creators of the laws of the world of flesh and blood do not look at the world through the lens of and , then it is also the case that their laws do not have these concepts embedded in their letter and that, therefore, their application on a decentralised and autonomous factual substratum will overlook in whole or in part the of that factual substratum. In other words: the laws and their application will the decentralised and autonomous dimension of the conflict, so that the conflict will be resolved as if there were no decentralisation and autonomy. decentralisation autonomy decentralised and autonomous nature disregard And it makes no difference to me whether "X is not in Y" or "X being in Y, X is disregarded as being in Y". ➡️➡️➡️ Conflicts with a decentralised and autonomous dimension that are solved by very cool alternative legal operators, at the time, by humans governed by their own will, and nothing else And if these conflicts are solved under alternative conflict resolution procedures (panels of experts, forums of wills or opinion polls outside the blockchain, arbitration tribunals...) which, for the sake of this alternativity, are already considered very cool, the setback is even worse. For under the (apparent) success that the conflict where at least one party is an autonomous and decentralised entity is no longer resolved by inconsiderate state laws, but by highly regarded experts or those considered as such, what we are falling into is personalism. And this only departs in degree, but not in quality, from caveman conflict resolution by the tribal sorcerer. ad hoc Humans have not been trampling the earth for two hundred thousand years —to put a figure on it— to escape the reptilian law of men by way of the rule of law in order to, in more refined but no less unjust ways, end up by overthrowing the rule of law by submitting to the will of a forum of (supposedly) very cool experts: humans. Even the worst of laws with judges is better than the best of judges without laws, if only because the former, at least, will always resolve in the same way, while the latter, who knows how they will end up resolving the day they let themselves be carried away by their rages… ➡️➡️➡️ Conflicts with a decentralised and autonomous dimension that are resolved by autonomous and decentralised laws which, as such, provide for decentralisation and autonomy This, and no other, is the end of the road if the product of phases 1 and 2 is to survive in the long term. A law, the (i) which, as a code inserted in the blockchain, contains rules that are intrinsically decentralised in their conception, whose application generates equally decentralised outputs; and (ii) which, as a self-executing code, is applied whether or not its addressees inside and outside the chain want it to be applied, thus endowing the system with , making the system autonomous with respect to the world of flesh and blood, freeing it from both the rule of law and the law of men. Autonomous Law autonomycity (In)conclusion ➡️ The MetaLeX project is ambitious and exciting. But we shall see whether it remains a wet dream, because even its successful implementation is not enough to make it a successful project. If it is based on the creation of an , then to the creation must be added the , if not generalised, then relevant, at least at the sectoral level, of the Autonomous Law created. Autonomous Law adoption Let us explain. The birth of a Legal System is the result of a pact. But not just any pact. It is a pact for at least two reasons. sui generis It is —first reason— because it is a founding pact and, as such, a ; a pact that subjugates —or so it intends— all the other pacts that exist or will exist, just as the contained, and therefore subjugated —and that one really subjugated…— the . Such a pact is called "constituent" (it is, moreover, the first constitutional pact which can later be modified by other constitutional pacts but which are no longer constituent), and what has been agreed is called "Constitution" or "Magna Carta". sui generis pact of pacts One Ring Rings of Power And that Constitution has the vocation of , which is an exception (and a very big one) to the principle of relativity of contracts, a principle whereby —thank God— agreements only have effects between their parties —and for this reason it is also , second reason. having effects vis-à-vis third parties sui generis Of course, the contracting parties are supposed to act on the mandate (representative at least, imperative as a desideratum) of these third parties. They could not otherwise be bound by this agreement, nor by any other. So by representation (imperative or not) the third parties assume the Constitution just as a third party can assume a contract (it is the figure of the assumption of a contract by a third party). However, for the to work, it is necessary, not only that the greatest number of third parties of the target community assume it, but that all third parties of that community assume it, that the community (be it group, tribe, team, club, society…) assume it as a community. And it is often much more problematic to implement this statement: constituent thing for every Si subject of the community {Si}, Si assumes the covenant, than this other: for a majority of Si subjects of the community {Yes}, Si assumes the pact. Why? Because the world doesn't need to be full of to fuck up the invention; it's enough that there is one for that, to fuck it up. And the fact is that the word “all” beyond rhetoric and poetics becomes a word as problematic as it is problematic —speaking — to prove that . free riders à la Hempel ”all ravens are black” Following the brilliant Searle —later terribly reviled— we can say that: A proposition counts as a rule if it is accepted that this proposition is a rule. This sounds like a truism, but it is not. If I say to you: (Ⲁ) "To get into my house you have to take off your shoes", that proposition will only be a rule if you, as well as I, accept it as a rule. For of a proposition that pretends to be a rule and is not followed by anyone we do not know whether it can be predicated to be a rule —Wittgenstein may have gone half-mad over something like that. And this will be the case of the autDAO after the end of phase 2: they will be entities of the world governed by rules that will be accepted ad intra. But their ad extra acceptance will require an exogenous-dependent plus. And we continue with Searle : 3 "rules of the form are then constitutive of institutional structures”. X counts as Y in C Which we can rewrite as follows: When a proposition counts as a rule in a community, the rule is institutionalised and we can predicate it to be a law that community. for Which, following our example of my house and your shoes, would mean that the proposition (Ⲁ) would not require your acceptance to be a rule if it is the case that in the neighbourhood in which you and I live it has already been accepted as a rule: it is a neighbourhood law —so to speak. All of which, translated to the matter at hand, means that: For the autDAO rules to count as in the blockchain community, it is necessary for the community to consider them as such. Autonomous Law This conclusion is quite hopeless for MetaLeX as the blockchain community is a network of networks made up of tens or hundreds of thousands of communities (layer 1, 2… n; more with the protocols within each layer; more with the organisations within each protocol…). But in the same hopelessness we can find a glimmer of hope, like : Blochian red heroes It is a matter of implementing the community by community blockchain until a relevant group of them accepts it as a supracommunity, (just as the neighbours in your neighbourhood and mine have been accepting house by house and case by case that all houses are entered barefoot). Autonomous Law Or so we see it in ! #másqueley Also published . here

The MetaLeX Whitepaper

In today's edition: What does research say about how far we are from AGI? News from the usual subjects: Anthropic, Cohere, OpenAI, etc. The freshest AI&ML research papers from the week of Mar 4 — Mar 10 Though the question, “ ” predates the term “artificial intelligence” itself, it saw a significant resurgence on Twitter last week, prompted by the Musk vs. OpenAI lawsuit (Musk accuses OpenAI of abandoning open-source principles and prioritizing profit over safety, hindering the safe development of AGI.) . Today, we will discuss “How Far Are We from Intelligent Visual Deductive Reasoning?” “How Far Are We From Automating Front-End Engineering?” and Stephen Wolfram’s article “Can AI Solve Science?” These papers offer fascinating explorations of the differences between human and artificial intelligence. How far are we from achieving human-level intelligence in machines (or AGI, or ASI)? But far more interesting were the papers and an article that came out last week tackling this question Intelligent Visual Deductive Reasoning In “ ?”, researchers from Apple explore Vision-Language Models (VLMs), like GPT-4V, in visual-based deductive reasoning, a complex yet less studied area, using Raven’s Progressive Matrices (RPMs)*. How Far Are We from Intelligent Visual Deductive Reasoning *Raven’s Progressive Matrices is a nonverbal intelligence test measuring abstract reasoning, using patterns to assess cognitive functioning without language. What caught my attention was the finding that . The paper notes, “ ” This inability to deal with abstract concepts marks a fundamental difference between computational processing and human cognitive abilities. AI systems like VLMs struggle with tasks requiring abstract pattern recognition and deduction VLMs struggle to solve these tasks mainly because they are unable to perceive and comprehend multiple, confounding abstract patterns in RPM examples. Being a sophisticated pattern recognizer doesn’t equate to sentience. The observation that “ ” highlights , suggesting a nuanced aspect of intelligence that current AI lacks. Another intriguing point was the models’ overconfidence. all the tested models never express any level of uncertainty the importance of doubt and uncertainty in human cognition Automating Front-End Engineers In “ ”, researchers from Stanford University, Georgia Tech, Microsoft, and Google DeepMind have developed a benchmark for Design2Code, aiming to evaluate how well multimodal LLMs convert visual designs into code. Here, the replacement of humans came closer. Despite some limitations, there were considerable advancements in using generative AI to convert designs into front-end code. It’s remarkable that “ .” This finding challenges traditional notions of artistic and creative value, Design2Code: How Far Are We From Automating Front-End Engineering? annotators think GPT-4V generated webpages can replace the original reference webpages in 49% of cases in terms of visual appearance and content; and in 64% of cases, GPT-4V generated webpages are considered better questioning whether creativity is uniquely human or can be algorithmically reproduced — or even surpassed. However, . VLMs struggle with “ ” posing questions about understanding and interpretation. significant limitations persist recalling visual elements from the input webpages and generating correct layout designs. So, the important question is actually not how far we are from AGI (whatever it is), but how we embrace human-AI collaboration most effectively. AI Solving Science In that sense, Stephen Wolfram’s blog post “ ” serves as an excellent example. In the very beginning, he plainly states that AI cannot solve all scientific questions. However, there is significant value in AI assisting scientific progress. He discusses how LLMs can serve as a new kind of linguistic interface to computational capabilities, providing high-level “autocomplete” for scientific work. As he usually does, he emphasizes the transformative potential of representing the world computationally and suggests that pockets of computational reducibility* can be found by AI as well. Can AI Solve Science? *A pocket of computational reducibility — a fascinating concept introduced by Wolfram — is a situation or problem within a complex system where, despite the system’s overall unpredictability, predictable patterns or simplified behaviors emerge, allowing for easier understanding or calculation. Wolfram argues that AI can significantly aid scientific discovery by providing new tools for analysis and exploration, but its ability to completely “solve” science is limited by fundamental principles such as computational irreducibility. The future of AI in science lies in its integration with human creativity and understanding, leveraging its strengths to uncover new knowledge within the constraints of what is computationally possible. We might be able to survive without front-end developers (no offense intended), but scientists remain indispensable! To summarize: https://x.com/pmddomingos/status/1766945083314827455?s=20&embedable=true News from The Usual Suspects © Cohere and its commitment to the research community https://x.com/cohere/status/1767275128813928611?s=20&embedable=true Hugging Face Starting an ambitious open robotics project and hiring , a former Tesla scientist, to expand beyond software into robotics, including work on humanoid robots like Tesla’s Optimus. Remi Cadene Offers an amazing tool: https://x.com/maximelabonne/status/1767124527551549860?s=20&embedable=true Russia’s talent is invisible According to “The Global AI Talent Tracker 2.0”, Russia has no chance in the AI race: this analysis Inflection enhances its Pi Inflection , enhancing its personal AI, Pi, with IQ capabilities alongside its empathetic EQ. They claim to compete with GPT-4, achieving significant efficiency and performance improvements, especially in STEM areas, with less computational resource usage. launches Inflection-2.5 Chips TSMC (based in Taiwan), the world’s largest contract chipmaker, is for an Arizona chip plant. This funding, part of the CHIPS and Science Act of 2022, aims to boost domestic semiconductor production. TSMC’s $40 billion investment in the plant marks one of the largest foreign investments in U.S. history. expected to receive over $5 billion in U.S. federal grants OpenAI: new members on the board Sam Altman is reinstated as a member of the OpenAI board. , with a rich history as the CEO of the Bill and Melinda Gates Foundation, brings extensive experience in healthcare and philanthropy. , a seasoned executive with roles at Sony Entertainment and as a lawyer, offers legal and entertainment industry insights. , leading Instacart and with a background at Meta Platforms, including as head of Facebook, contributes expertise in technology and e-commerce. This diverse trio enhances OpenAI’s governance with their wide-ranging expertise and perspectives. He is joined by three women: Sue Desmond-Hellmann Nicole Seligman Fidji Simo Elon’s Grok https://x.com/elonmusk/status/1767108624038449405?s=20&embedable=true Anthropic Offers a great collection of prompts in its Prompt library Enjoyed This Story? I write a weekly analysis of the AI world in the newsletter. We aim to equip you with comprehensive knowledge and historical insights, so you can make informed decisions about AI and ML. Turing Post 🎁 Bonus: The freshest research papers, categorized for your convenience Enhancements in Language Models and Multimodal Understanding : Showcases an LLM’s intrinsic ability to understand and generate music, expanding LLMs’ applications beyond text. ChatMusician Read the paper : Demonstrates advanced multimodal understanding by processing extensive contexts of text, video, and audio. Gemini 1.5 Read the paper : Enhances TTS synthesis with a factorized diffusion model for zero-shot natural speech generation. NaturalSpeech 3 Read the paper : Utilizes fine-tuned MLMs for superior image-text data filtering, improving dataset quality for MLM training. Finetuned Multimodal Language Models Are High-Quality Image-Text Data Filters Read the paper : Introduces the first LLM designed for the legal domain, demonstrating proficiency in legal text understanding and generation. SaulLM-7B Read the paper Novel Training and Evaluation Techniques : Proposes a method for scaling instruction tuning in mathematical reasoning, significantly enhancing LLMs’ problem-solving abilities. MathScale Read the paper : Reveals redundancy in LLM layers and proposes a pruning strategy, maintaining performance while reducing model size. ShortGPT Read the paper : Enhances memory efficiency in LLM training without sacrificing performance by applying gradient low-rank projection. GaLore Read the paper : Develops a method for collaborative decoding among multiple LLMs, improving performance across various tasks. Learning to Decode Collaboratively with Multiple Language Models Read the paper : Advocates for training RL value functions through classification instead of regression, boosting performance and scalability. Stop Regressing Read the paper Advances in Generative Models and Data Synthesis : Introduces a framework for generating synthetic multimodal datasets, overcoming limitations in data privacy and diversity. MAGID Read the paper : Trains a generative model to create interactive virtual worlds from text, images, or sketches, advancing interactive environment simulation. Read the paper Genie Scalability and Efficiency in AI Systems : Details a system for training LLMs on over 10,000 GPUs, tackling challenges in training efficiency and stability at large scales. MegaScale Read the paper : Improves State Space Models with dense hidden connections for efficient large language models, enhancing performance with minimal parameter increase. DenseMamba Read the paper Exploring New Frontiers in AI and Machine Learning : Illustrates that planning and prediction in time series can be simplified through learned contrastive representations. Inference via Interpolation Read the paper : Employs simulated trial and error for tool learning, significantly enhancing LLMs’ practical application capabilities. LLMs in the Imaginarium Read the paper : Aims to improve context length generalization in LLMs by refining interpolation techniques for out-of-distribution token positions. Resonance RoPE Read the paper : Enhances the localization of behaviors in LLMs to specific components, improving diagnostic capabilities and model understanding. AtP Read the paper : Investigates using world models for enhancing visual representation learning, beyond reinforcement learning applications. Learning and Leveraging World Models in Visual Representation Learning Read the paper Platforms and Tools for Model Evaluation and Interaction : Provides a platform for evaluating LLMs based on human preferences, offering insights into model rankings through pairwise comparisons. Chatbot Arena Read the paper : Explores enhancing LLMs’ reasoning capabilities using RLHF, comparing different algorithms and reward strategies. Teaching Large Language Models to Reason with Reinforcement Learning Read the paper Also published . here

How Far Are We From Human-level Intelligence in AI?

ERIK ADOLPH vs. Uber Court Filing, retrieved on July 17, 2023, is part of . You can jump to any part in this filing . This is part 4 of 15. HackerNoon’s Legal PDF Series here III. Against this backdrop, we consider whether an aggrieved employee who has been compelled to arbitrate individual claims “premised on Labor Code violations actually sustained by” the plaintiff (Viking River, supra, 596 U.S. at p. __ [142 S.Ct. at p. 1916]; see Lab. Code, § 2699, subd. (a)) maintains statutory standing to pursue non-individual “PAGA claims arising out of events involving other employees” (Viking River, at p. __ [142 S.Ct. at p. 1916]) in court. The high court concluded that a PAGA plaintiff loses standing in this situation: “[A]s we see it, PAGA provides no mechanism to enable a court to adjudicate non-individual PAGA claims once an individual claim has been committed to a separate proceeding. Under PAGA’s standing requirement, a plaintiff can maintain non-individual PAGA claims in an action only by virtue of also maintaining an individual claim in that action. See Cal. Lab. Code Ann. §§ 2699(a), (c). When an employee’s own dispute is pared away from a PAGA action, the employee is no different from a member of the general public, and PAGA does not allow such persons to maintain suit. See Kim, 9 Cal.5th at 90 (‘PAGA’s standing requirement was meant to be a departure from the “general public” . . . standing originally allowed’ under other California statutes). As a result, Moriana lacks statutory standing to continue to maintain her non-individual claims in court, and the correct course is to dismiss her remaining claims.” (Viking River, supra, 596 U.S. at p. __ [142 S.Ct. at p. 1925].) Because “[t]he highest court of each State . . . remains ‘the final arbiter of what is state law’ ” (Montana v. Wyoming (2011) 563 U.S. 368, 378, fn. 5), we are not bound by the high court’s interpretation of California law. (See Viking River, supra, 596 U.S. at pp. [142 S.Ct. at p. 1925] (conc. opn. of Sotomayor, J.) [“Of course, if this Court’s understanding of state law is wrong, California courts, in an appropriate case, will have the last word.”].) And although the high court’s interpretations may serve as persuasive authority in cases involving a parallel federal constitutional provision or statutory scheme (cf., e.g., Raven v. Deukmejian (1990) 52 Cal.3d 336, 353; People v. Teresinski (1982) 30 Cal.3d 822, 835–836), Viking River does not interpret any federal provision or statute similar to PAGA. – Where, as here, a cause of action is based on a state statute, standing is a matter of statutory interpretation. (Kim, supra, 9 Cal.5th at p. 83.) “We review questions of statutory construction de novo.” (California Building Industry Assn. v. State Water Resources Control Bd. (2018) 4 Cal.5th 1032, 1041.) Continue Reading . Here About HackerNoon Legal PDF Series: We bring you the most important technical and insightful public domain court case filings. This court case S274671 retrieved on September 22, 2023, from is part of the public domain. The court-created documents are works of the federal government, and under copyright law, are automatically placed in the public domain and may be shared without legal restriction. courts.ca.gov

RAVEN

raven.dev

-- employees

Since n.d.

COMPANY RANKING

RAVEN

EVERGREEN INDEX #8871

Representing this company? Click here to claim and customize this page!

Raven WIKI

Apply to get your Tech Company News Page live on HackerNoon.com today!

RAVEN

raven.dev

-- employees

Since n.d.

COMPANY RANKING

RAVEN

EVERGREEN INDEX #8871

RELATED COMPANIESRANK

STORIES ABOUT RAVEN

Representing this company? Click here to claim and customize this page!

Raven WIKI

Apply to get your Tech Company News Page live on HackerNoon.com today!