Aya Kantorovich, CEO of August Digital, explains why poor risk management could trigger the next on-chain blowup — and why not all DAATs are created equal.
🎥 Watch the full interview for more insights from Korean Blockchain Week: https://youtu.be/deO4TDjpeiA
#DAATs #KBW
🎥 Watch the full interview for more insights from Korean Blockchain Week: https://youtu.be/deO4TDjpeiA
#DAATs #KBW
November 10, 2025 at 9:03 PM
Aya Kantorovich, CEO of August Digital, explains why poor risk management could trigger the next on-chain blowup — and why not all DAATs are created equal.
🎥 Watch the full interview for more insights from Korean Blockchain Week: https://youtu.be/deO4TDjpeiA
#DAATs #KBW
🎥 Watch the full interview for more insights from Korean Blockchain Week: https://youtu.be/deO4TDjpeiA
#DAATs #KBW
target joint probability measure, and determines the Kantorovich formulation. Finding the ground cost leads to solving a structured deterministic nonlinear optimal control problem, which is shown to be amenable to an analysis technique pioneered by [5/7 of https://arxiv.org/abs/2504.03190v1]
April 7, 2025 at 6:07 AM
target joint probability measure, and determines the Kantorovich formulation. Finding the ground cost leads to solving a structured deterministic nonlinear optimal control problem, which is shown to be amenable to an analysis technique pioneered by [5/7 of https://arxiv.org/abs/2504.03190v1]
arXiv:2504.08722v1 Announce Type: new
Abstract: In this note, I review entropy-regularized Monge-Kantorovich problem in Optimal Transport, and derive the gradients of several popular algorithms popular in Computational Optimal Transport, including [1/2 of https://arxiv.org/abs/2504.08722v1]
Abstract: In this note, I review entropy-regularized Monge-Kantorovich problem in Optimal Transport, and derive the gradients of several popular algorithms popular in Computational Optimal Transport, including [1/2 of https://arxiv.org/abs/2504.08722v1]
April 14, 2025 at 6:07 AM
arXiv:2504.08722v1 Announce Type: new
Abstract: In this note, I review entropy-regularized Monge-Kantorovich problem in Optimal Transport, and derive the gradients of several popular algorithms popular in Computational Optimal Transport, including [1/2 of https://arxiv.org/abs/2504.08722v1]
Abstract: In this note, I review entropy-regularized Monge-Kantorovich problem in Optimal Transport, and derive the gradients of several popular algorithms popular in Computational Optimal Transport, including [1/2 of https://arxiv.org/abs/2504.08722v1]
In the early days of deep learning, there were a lot of genuinely interesting mathematical ideas (e.g., new insight on Kantorovich duality). But practitioners soon discovered they got the best results by just frobbing until it worked.
December 5, 2024 at 12:05 PM
In the early days of deep learning, there were a lot of genuinely interesting mathematical ideas (e.g., new insight on Kantorovich duality). But practitioners soon discovered they got the best results by just frobbing until it worked.
investigate the application of multivariate sampling Kantorovich (SK) operators for image reconstruction, with a particular focus on gap filling and speckle noise reduction. To understand the accuracy performances of the proposed algorithms, we first [2/6 of https://arxiv.org/abs/2505.02422v1]
May 6, 2025 at 6:06 AM
investigate the application of multivariate sampling Kantorovich (SK) operators for image reconstruction, with a particular focus on gap filling and speckle noise reduction. To understand the accuracy performances of the proposed algorithms, we first [2/6 of https://arxiv.org/abs/2505.02422v1]
assess the system's stability under fixed parameter values. The resulting eigenvalue problem is numerically solved using a fourth-order accurate finite difference scheme combined with Newton-Raphson-Kantorovich iterations. The results indicate that [2/4 of https://arxiv.org/abs/2503.09603v1]
March 14, 2025 at 6:08 AM
assess the system's stability under fixed parameter values. The resulting eigenvalue problem is numerically solved using a fourth-order accurate finite difference scheme combined with Newton-Raphson-Kantorovich iterations. The results indicate that [2/4 of https://arxiv.org/abs/2503.09603v1]
Kantorovich having to write "objectively determined constraints" instead of "shadow prices" lol
July 21, 2025 at 11:29 PM
Kantorovich having to write "objectively determined constraints" instead of "shadow prices" lol
There's a reason why Leonid Kantorovich won the "Stalin Prize" and that the Soviet Union was so interested in linear programming! (RIP Kantorovich, you would have loved Microsoft Excel).
December 7, 2024 at 3:30 PM
There's a reason why Leonid Kantorovich won the "Stalin Prize" and that the Soviet Union was so interested in linear programming! (RIP Kantorovich, you would have loved Microsoft Excel).
Very nice! It would be great to see visualizations for the less intuitive formulations, like the continuous case of the Monge problem, or the Kantorovich problem.
January 20, 2025 at 8:23 PM
Very nice! It would be great to see visualizations for the less intuitive formulations, like the continuous case of the Monge problem, or the Kantorovich problem.
Leonid Kantorovich remains the most essential figure of 20th century socialism.
May 8, 2025 at 6:31 PM
Leonid Kantorovich remains the most essential figure of 20th century socialism.
transport problem introduced by Gozlan, Roberto, Samson, and Tetali. As applications we provide concise derivations of the Brenier--Strassen theorem, the convex Kantorovich--Rubinstein formula and the structure theorem of [3/5 of https://arxiv.org/abs/2501.16316v1]
January 28, 2025 at 6:16 AM
transport problem introduced by Gozlan, Roberto, Samson, and Tetali. As applications we provide concise derivations of the Brenier--Strassen theorem, the convex Kantorovich--Rubinstein formula and the structure theorem of [3/5 of https://arxiv.org/abs/2501.16316v1]
“Wake Up.”
*that lamp looks…off somehow. why is the lightsha-*
The year is 1921, Tsar Nicholas II is dead. “просыпайся сейчас же!,” your mother calls. In only two comatic weeks, you lived a rich and colorful 26 years in the information era. Your name is Leonid Kantorovich, the future is yours.
*that lamp looks…off somehow. why is the lightsha-*
The year is 1921, Tsar Nicholas II is dead. “просыпайся сейчас же!,” your mother calls. In only two comatic weeks, you lived a rich and colorful 26 years in the information era. Your name is Leonid Kantorovich, the future is yours.
January 5, 2025 at 4:09 AM
“Wake Up.”
*that lamp looks…off somehow. why is the lightsha-*
The year is 1921, Tsar Nicholas II is dead. “просыпайся сейчас же!,” your mother calls. In only two comatic weeks, you lived a rich and colorful 26 years in the information era. Your name is Leonid Kantorovich, the future is yours.
*that lamp looks…off somehow. why is the lightsha-*
The year is 1921, Tsar Nicholas II is dead. “просыпайся сейчас же!,” your mother calls. In only two comatic weeks, you lived a rich and colorful 26 years in the information era. Your name is Leonid Kantorovich, the future is yours.
Vasili Nemchinov, a direct disciple of Kantorovich and Veduta, popularized the idea of "inter-industrial balance" (MOB, by its Russian acronym, or mezh-otraslevye balansy) as an embodiment of this. In practice this did not differ much from Leontief's I/O methodology.
November 7, 2024 at 4:10 PM
Vasili Nemchinov, a direct disciple of Kantorovich and Veduta, popularized the idea of "inter-industrial balance" (MOB, by its Russian acronym, or mezh-otraslevye balansy) as an embodiment of this. In practice this did not differ much from Leontief's I/O methodology.
Gergely Bunth, J\'ozsef Pitrik, Tam\'as Titkos, D\'aniel Virosztek: Strong Kantorovich duality for quantum optimal transport with generic cost and optimal couplings on quantum bits https://arxiv.org/abs/2510.26326 https://arxiv.org/pdf/2510.26326 https://arxiv.org/html/2510.26326
October 31, 2025 at 6:44 AM
Gergely Bunth, J\'ozsef Pitrik, Tam\'as Titkos, D\'aniel Virosztek: Strong Kantorovich duality for quantum optimal transport with generic cost and optimal couplings on quantum bits https://arxiv.org/abs/2510.26326 https://arxiv.org/pdf/2510.26326 https://arxiv.org/html/2510.26326
“Allowing non-convexity messes up the markets-are-always-optimal theorems of neo-classical/bourgeois economics, too. ([Thus] Stiglitz’s contention that if the neo-classicals were right about how capitalism works, Kantorovich-style socialism would have been perfectly viable.)”
July 26, 2023 at 7:35 PM
“Allowing non-convexity messes up the markets-are-always-optimal theorems of neo-classical/bourgeois economics, too. ([Thus] Stiglitz’s contention that if the neo-classicals were right about how capitalism works, Kantorovich-style socialism would have been perfectly viable.)”
Join the PIMS Kantorovich Initiative at the CRM-PIMS-AARMS Special Session on Optimal Transport on Jan 10 & 11.
This session features talks by scientific leaders on optimal transport and its applications.
📍 Seattle Convention Center
🔗 Learn more and register: tinyurl.com/tkshh2nj
#JMM2025
This session features talks by scientific leaders on optimal transport and its applications.
📍 Seattle Convention Center
🔗 Learn more and register: tinyurl.com/tkshh2nj
#JMM2025
January 6, 2025 at 10:23 PM
Join the PIMS Kantorovich Initiative at the CRM-PIMS-AARMS Special Session on Optimal Transport on Jan 10 & 11.
This session features talks by scientific leaders on optimal transport and its applications.
📍 Seattle Convention Center
🔗 Learn more and register: tinyurl.com/tkshh2nj
#JMM2025
This session features talks by scientific leaders on optimal transport and its applications.
📍 Seattle Convention Center
🔗 Learn more and register: tinyurl.com/tkshh2nj
#JMM2025
Enjoyed Number Crunch @NYtimes mag by Hefferman @page88 with note of Kantorovich + Dantzig + linear programming http://nyti.ms/1xc9oEE #orms
nytimes.com
nyti.ms
December 7, 2024 at 3:01 AM
Enjoyed Number Crunch @NYtimes mag by Hefferman @page88 with note of Kantorovich + Dantzig + linear programming http://nyti.ms/1xc9oEE #orms
Pooja Gupta: Modified Kantorovich-type Sampling Series in Orlicz Space Frameworks https://arxiv.org/abs/2504.15242 https://arxiv.org/pdf/2504.15242 https://arxiv.org/html/2504.15242
April 22, 2025 at 6:04 AM
Pooja Gupta: Modified Kantorovich-type Sampling Series in Orlicz Space Frameworks https://arxiv.org/abs/2504.15242 https://arxiv.org/pdf/2504.15242 https://arxiv.org/html/2504.15242
🔄 Updated Arxiv Paper
Title: Kantorovich-Rubinstein duality theory for the Hessian
Authors: Karol Bo{\l}botowski, Guy Bouchitt\'e
Read more: https://arxiv.org/abs/2412.00516
Title: Kantorovich-Rubinstein duality theory for the Hessian
Authors: Karol Bo{\l}botowski, Guy Bouchitt\'e
Read more: https://arxiv.org/abs/2412.00516
November 4, 2025 at 11:52 AM
🔄 Updated Arxiv Paper
Title: Kantorovich-Rubinstein duality theory for the Hessian
Authors: Karol Bo{\l}botowski, Guy Bouchitt\'e
Read more: https://arxiv.org/abs/2412.00516
Title: Kantorovich-Rubinstein duality theory for the Hessian
Authors: Karol Bo{\l}botowski, Guy Bouchitt\'e
Read more: https://arxiv.org/abs/2412.00516
arXiv:2502.05683v1 Announce Type: new
Abstract: We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein [1/7 of https://arxiv.org/abs/2502.05683v1]
Abstract: We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein [1/7 of https://arxiv.org/abs/2502.05683v1]
February 11, 2025 at 6:15 AM
arXiv:2502.05683v1 Announce Type: new
Abstract: We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein [1/7 of https://arxiv.org/abs/2502.05683v1]
Abstract: We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein [1/7 of https://arxiv.org/abs/2502.05683v1]
The reason the Accelerationists are so hot for AI is they believe it will be able to do what Kantorovich told Stalin it could do in 1949: model all of the essentials of life such that democracy and capitalism will wither away.
They even use the same algorithms.
They even use the same algorithms.
May 31, 2025 at 9:30 PM
The reason the Accelerationists are so hot for AI is they believe it will be able to do what Kantorovich told Stalin it could do in 1949: model all of the essentials of life such that democracy and capitalism will wither away.
They even use the same algorithms.
They even use the same algorithms.
Cuando Kantorovich desarrolló su algoritmo en los años 30, los problemas se debían resolver a mano 📝, limitando el tamaño de los problemas que se podían resolver a una modesta escala.
November 7, 2024 at 4:21 PM
Cuando Kantorovich desarrolló su algoritmo en los años 30, los problemas se debían resolver a mano 📝, limitando el tamaño de los problemas que se podían resolver a una modesta escala.
I wonder if Comrade Kantorovich, who first discovered the algorithms for computational linear algebra 90 years ago, and who dreamed that one day they would free all mankind from labor, would be dismayed to learn that these days we mostly use it to make porn.
August 4, 2024 at 9:38 PM
I wonder if Comrade Kantorovich, who first discovered the algorithms for computational linear algebra 90 years ago, and who dreamed that one day they would free all mankind from labor, would be dismayed to learn that these days we mostly use it to make porn.