Tootfinder

Ana de Castro's high-point highlight catch sets up first and goal for the Cowboys https://www.nfl.com/videos/ana-de-castro-s-high-point-highlight-catch-sets-up-first-and-goal-for-the-cowboys

SIGN: Safety-Aware Image-Goal Navigation for Autonomous Drones via Reinforcement Learning
Zichen Yan, Rui Huang, Lei He, Shao Guo, Lin Zhao
https://arxiv.org/abs/2508.12394 http…

SIGN: Safety-Aware Image-Goal Navigation for Autonomous Drones via Reinforcement Learning
Image-goal navigation (ImageNav) tasks a robot with autonomously exploring an unknown environment and reaching a location that visually matches a given target image. While prior works primarily study ImageNav for ground robots, enabling this capability for autonomous drones is substantially more challenging due to their need for high-frequency feedback control and global localization for stable flight. In this paper, we propose a novel sim-to-real framework that leverages visual reinforcement l…

Hollywood Brown's No. 1 goal in 2025: 'Healthy season' https://www.nfl.com/news/hollywood-brown-s-no-1-goal-in-2025-healthy-season

"Paris goal of 1.5°C warming is still too hot for polar ice sheets, study warns"
#ParisAgreement #Climate #ClimateChange

Paris goal of 1.5°C warming is still too hot for polar ice sheets, study warns
At the landmark Paris climate agreement, nearly every country in the world pledged to a goal to limit warming to well below 2° Celsius (3.6° Fahrenheit) above preindustrial levels by 2100, and work toward a more ambitious goal to limit warming to 1.5°C (2.7°F). The hope is that such a limit will help Earth avoid […]

Goal-Directedness is in the Eye of the Beholder
Nina Rajcic, Anders S{\o}gaard
https://arxiv.org/abs/2508.13247 https://arxiv.org/pdf/2508.13247

Goal-Directedness is in the Eye of the Beholder
Our ability to predict the behavior of complex agents turns on the attribution of goals. Probing for goal-directed behavior comes in two flavors: Behavioral and mechanistic. The former proposes that goal-directedness can be estimated through behavioral observation, whereas the latter attempts to probe for goals in internal model states. We work through the assumptions behind both approaches, identifying technical and conceptual problems that arise from formalizing goals in agent systems. We arr…

Cowboys All-Pro DaRon Bland eyes lofty goal ahead of training camp https://www.si.com/nfl/cowboys/news/dallas-cowboys-all-pro-daron-bland-eyes-lofty-goal-2025-training-camp

The path to a goal: Understanding soccer possessions via path signatures
David Hirnschall, Robert Bajons
https://arxiv.org/abs/2508.12930 https://arxiv.org…

The path to a goal: Understanding soccer possessions via path signatures
We present a novel framework for predicting next actions in soccer possessions by leveraging path signatures to encode their complex spatio-temporal structure. Unlike existing approaches, we do not rely on fixed historical windows and handcrafted features, but rather encode the entire recent possession, thereby avoiding the inclusion of potentially irrelevant or misleading historical information. Path signatures naturally capture the order and interaction of events, providing a mathematically g…

Paris goal of 1.5°C warming is still too hot for polar ice sheets, study warns https://news.mongabay.com/short-article/2025/06/paris-goal-of-1-5c-warming-is-still-too-hot-for-polar-ice-sheets-study-warns/

Paris goal of 1.5°C warming is still too hot for polar ice sheets, study warns
At the landmark Paris climate agreement, nearly every country in the world pledged to a goal to limit warming to well below 2° Celsius (3.6° Fahrenheit) above preindustrial levels by 2100, and work toward a more ambitious goal to limit warming to 1.5°C (2.7°F). The hope is that such a limit will help Earth avoid […]

On the right, there is an “economic exploitation” faction whose goal is to get as close to slave labor as they can, and a racist faction whose goal is to be as cruel as possible to immigrants.
Those factions overlap, they align, some people gravitate to both — but they are not identical. They align •only• if the cruelty creates terrible labor conditions — not if the cruelty removes the labor entirely.
2/

Brian Stark: 'Our goal is to put together the best roster we can' https://www.raiders.com/video/brian-stark-raiders-training-camp-preseason-week-3-presser-nfl-08192025

A look at the lack of consensus in the tech industry on what AGI is, whether LLMs are the best path to it, and what AGI might look like if or when it arrives (Melissa Heikkilä/Financial Times)

Why Big Tech cannot agree on artificial general intelligence
It has been tipped as the next big breakthrough out of Silicon Valley, but is it a scientific goal — or a marketing buzzword?

A post from the archive 📫:
Radical amazement
#musings

Russia redeploys troops for new push in Zaporizhzhia Oblast, Ukraine's army chief says: https://benborges.xyz/2025/08/18/russia-redeploys-troops-for-new.html

What new story could a Democrat tell?
I’m not talking just about policy positions.
I’m talking about the bigger picture: Things like
“restore the soul of America” (ala Biden 2020),
or “hope and change” (ala Obama 2008)
or “make America great again” (sigh),
or any of the many iterations of restoring the American dream/rebuilding the American dream/the promise of America for working people/etc that candidates try to ladder their policy positions up into.

Stories Democrats could tell
Should we make people rich? Should we fight loneliness? What's the bigger goal?

Exciting Update: New Goal Set at €12,439! 💼 With your amazing help, we've already hit €5134. To reach our target, we're counting on you. Your support makes a real difference. Thank you for being part of this journey! 🙏 👉 https://chardonsbleus.org/donate

Cowboys' All-Pro offensive lineman sets lofty goal for 2025 NFL season https://www.si.com/nfl/cowboys/news/dallas-cowboys-all-pro-offensive-lineman-sets-lofty-goal-2025-nfl-season

That said, if you know that “sustainability” has been the only consistently communicated strategic goal of #UNIL for the last 8 years or so, the relative ranking of the universities in Lausanne may be surprise you.
https:/…

That said, if you know that “sustainability” has been the only consistently communicated strategic goal of #UNIL for the last 8 years or so, the relative ranking of the universities in Lausanne may be surprise you.
https:/…

What does it mean if an aircraft has a radar cross-section of 20 dB? #stealth #aviation

What does it mean if an aircraft has a radar cross-section of 20 dB?
In the Aviation Week issue of 15 February 1999, David A. Fulghum wrote the following in the article “JSF Reflection Is Golf Ball-Sized” on page 27: The overall goal of the JSF program is to produc...

Chelsea playing a strong lineup, but their defending, especially headed balls back across the face of goal... has been shocking in the second half. 👀
Conceded two goals in 4 minutes. Immediately after conceding the second, Nicolas Jackson gets a straight 🔴 for a textbook studs up challenge high up the leg. Indefensible. He'd just subbed on and was on the pitch for 4 whole minutes.
#FLACHE

Highlights from FPF’s July 2025 Technologist Roundtable: AI Unlearning and Technical Guardrails
https://fpf.org/blog/highlights-from-fpfs-july-2025-technologist-roundtable-ai-unlearning-and-technical-guardrails/

Which part of this does not exactly hold for Katz and his involvement in bombing hospitals in Gaza?
Certainly that in the civilised world due process is part of life.
Context:

MAPF-World: Action World Model for Multi-Agent Path Finding
Zhanjiang Yang, Meng Li, Yang Shen, Yueming Li, Lijun Sun
https://arxiv.org/abs/2508.12087 https://

MAPF-World: Action World Model for Multi-Agent Path Finding
Multi-agent path finding (MAPF) is the problem of planning conflict-free paths from the designated start locations to goal positions for multiple agents. It underlies a variety of real-world tasks, including multi-robot coordination, robot-assisted logistics, and social navigation. Recent decentralized learnable solvers have shown great promise for large-scale MAPF, especially when leveraging foundation models and large datasets. However, these agents are reactive policy models and exhibit limi…

Red Teaming Methodology for Design Obfuscation
Yuntao Liu, Abir Akib, Zelin Lu, Qian Xu, Ankur Srivastava, Gang Qu, David Kehlet, Nij Dorairaj
https://arxiv.org/abs/2508.13965 h…

Red Teaming Methodology for Design Obfuscation
The main goal of design obfuscation schemes is to protect sensitive design details from untrusted parties in the VLSI supply chain, including but not limited to off-shore foundries and untrusted end users. In this work, we provide a systematic red teaming approach to evaluate the security of design obfuscation approaches. Specifically, we propose security metrics and evaluation methodology for the scenarios where the adversary does not have access to a working chip. A case study on the RIPPER t…

Less than 500€ and less than a day for #peertube fund raising to goal 3 of 4
Goal 3 is live streaming from the app! Please, let's make it happen.
[Update: Goal 3/4 achieved! ❤️]
https://support.joinpeertube.org/en/

Support PeerTube
Let's popularize videos shared by the people, for the people!

Finite Axiomatizability by Disjunctive Existential Rules
Marco Calautti, Marco Console, Andreas Pieris
https://arxiv.org/abs/2508.11946 https://arxiv.org/p…

Finite Axiomatizability by Disjunctive Existential Rules
Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive tuple-generating dependencies in the database literature) form such a prominent rule-based language. The goal of this work is to pinpoint the expressive power of disjunctive existential rules in terms of insightful model-theoretic properties. More precisely, g…

No footpath to be seen here, but a short impression from near the goal of our morning hike today, back down before more mountain bikers, hikers and horseflies arrived, then followed by a good day's work until late...
Ps. Sound on!
#FootpathFriday #LandscapePhotography

"Outgrow the System": A one hour PBS documentary that explores alternative economic systems that work towards the goal of ecological and social balance as opposed to growth
https://www.pbs.org/video/outgrow-the-system-9uhrnm/

Outgrow the System
This film explores how we can design an economic system that genuinely manages our scarce resources.

As long as error messages like this can happen, I refuse consider the possibility that matrix could be a secure messaging solution for the masses. I mean... you can't be serious?
If your goal is average users, your No 1 design principle must be that you never bother users with the details of your technical design, which they don't understand anyway. That's a main reason why PGP failed, and people still don't get it. (I mean... I don't understand what that means, and …

Uncovering Intention through LLM-Driven Code Snippet Description Generation
Yusuf Sulistyo Nugroho, Farah Danisha Salam, Brittany Reid, Raula Gaikovina Kula, Kazumasa Shimari, Kenichi Matsumoto
https://arxiv.org/abs/2506.15453

Uncovering Intention through LLM-Driven Code Snippet Description Generation
Documenting code snippets is essential to pinpoint key areas where both developers and users should pay attention. Examples include usage examples and other Application Programming Interfaces (APIs), which are especially important for third-party libraries. With the rise of Large Language Models (LLMs), the key goal is to investigate the kinds of description developers commonly use and evaluate how well an LLM, in this case Llama, can support description generation. We use NPM Code Snippets, co…

Thanks to you, we’ve raised €5134 ! Our goal: €12,439 to keep pushing this legal battle forward. Thank you for your generosity! 💙 👉 https://chardonsbleus.org/donate

Long post, game design
Crungle is a game designed to be a simple test of general reasoning skills that's difficult to play by rote memory, since there are many possible rule sets, but it should be easy to play if one can understand and extrapolate from rules. The game is not necessarily fair, with the first player often having an advantage or a forced win. The game is entirely deterministic, although a variant determines the rule set randomly.
This is version 0.1, and has not yet been tested at all.
Crungle is a competitive game for two players, each of whom controls a single piece on a 3x3 grid. The cells of the grid are numbered from 1 to 9, starting at the top left and proceeding across each row and then down to the next row, so the top three cells are 1, 2, and 3 from left to right, then the next three are 4, 5, and 6 and the final row is cells 7, 8, and 9.
The two players decide who shall play as purple and who shall play as orange. Purple goes first, starting the rules phase by picking one goal rule from the table of goal rules. Next, orange picks a goal rule. These two goal rules determine the two winning conditions. Then each player, starting with orange, alternate picking a movement rule until four movement rules have been selected. During this process, at most one indirect movement rule may be selected. Finally, purple picks a starting location for orange (1-9), with 5 (the center) not allowed. Then orange picks the starting location for purple, which may not be adjacent to orange's starting position.
Alternatively, the goal rules, movement rules, and starting positions may be determined randomly, or a pre-determined ruleset may be selected.
If the ruleset makes it impossible to win, the players should agree to a draw. Either player could instead "bet" their opponent. If the opponent agrees to the bet, the opponent must demonstrate a series of moves by both players that would result in a win for either player. If they can do this, they win, but if they submit an invalid demonstration or cannot submit a demonstration, the player who "bet" wins.
Now that starting positions, movement rules, and goals have been decided, the play phase proceeds with each player taking a turn, starting with purple, until one player wins by satisfying one of the two goals, or until the players agree to a draw. Note that it's possible for both players to occupy the same space.
During each player's turn, that player identifies one of the four movement rules to use and names the square they move to using that rule, then they move their piece into that square and their turn ends. Neither player may use the same movement rule twice in a row (but it's okay to use the same rule your opponent just did unless another rule disallows that). If the movement rule a player picks moves their opponent's piece, they need to state where their opponent's piece ends up. Pieces that would move off the board instead stay in place; it's okay to select a rule that causes your piece to stay in place because of this rule. However, if a rule says "pick a square" or "move to a square" with some additional criteria, but there are no squares that meet those criteria, then that rule may not be used, and a player who picks that rule must pick a different one instead.
Any player who incorrectly states a destination for either their piece or their opponent's piece, picks an invalid square, or chooses an invalid rule has made a violation, as long as their opponent objects before selecting their next move. A player who makes at least three violations immediately forfeits and their opponent wins by default. However, if a player violates a rule but their opponent does not object before picking their next move, the stated destination(s) of the invalid move still stand, and the violation does not count. If a player objects to a valid move, their objection is ignored, and if they do this at least three times, they forfeit and their opponent wins by default.
Goal rules (each player picks one; either player can win using either chosen rule):
End your turn in the same space as your opponent three turns in a row.
End at least one turn in each of the 9 cells.
End five consecutive turns in the three cells in any single row, ending at least one turn on each of the three.
End five consecutive turns in the three cells in any single column, ending at least one turn on each of the three.
Within the span of 8 consecutive turns, end at least one turn in each of cells 1, 3, 7, and 9 (the four corners of the grid).
Within the span of 8 consecutive turns at least one turn in each of cells 2, 4, 6, and 8 (the central cells on each side).
Within the span of 8 consecutive turns, end at least one turn in the cell directly above your opponent, and end at least one turn in the cell directly below your opponent (in either order).
Within the span of 8 consecutive turns at least one turn in the cell directly to the left of your opponent, and end at least one turn in the cell directly to the right of your opponent (in either order).
End 12 turns in a row without ending any of them in cell 5.
End 8 turns in a row in 8 different cells.
Movement rules (each player picks two; either player may move using any of the four):
Move to any cell on the board that's diagonally adjacent to your current position.
Move to any cell on the board that's orthogonally adjacent to your current position.
Move up one cell. Also move your opponent up one cell.
Move down one cell. Also move your opponent down one cell.
Move left one cell. Also move your opponent left one cell.
Move right one cell. Also move your opponent right one cell.
Move up one cell. Move your opponent down one cell.
Move down one cell. Move your opponent up one cell.
Move left one cell. Move your opponent right one cell.
Move right one cell. Move your opponent left one cell.
Move any pieces that aren't in square 5 clockwise around the edge of the board 1 step (for example, from 1 to 2 or 3 to 6 or 9 to 8).
Move any pieces that aren't in square 5 counter-clockwise around the edge of the board 1 step (for example, from 1 to 4 or 6 to 3 or 7 to 8).
Move to any square reachable from your current position by a knight's move in chess (in other words, a square that's in an adjacent column and two rows up or down, or that's in an adjacent row and two columns left or right).
Stay in the same place.
Swap places with your opponent's piece.
Move back to the position that you started at on your previous turn.
If you are on an odd-numbered square, move to any other odd-numbered square. Otherwise, move to any even-numbered square.
Move to any square in the same column as your current position.
Move to any square in the same row as your current position.
Move to any square in the same column as your opponent's position.
Move to any square in the same row as your opponent's position.
Pick a square that's neither in the same row as your piece nor in the same row as your opponent's piece. Move to that square.
Pick a square that's neither in the same column as your piece nor in the same column as your opponent's piece. Move to that square.
Move to one of the squares orthogonally adjacent to your opponent's piece.
Move to one of the squares diagonally adjacent to your opponent's piece.
Move to the square opposite your current position across the middle square, or stay in place if you're in the middle square.
Pick any square that's closer to your opponent's piece than the square you're in now, measured using straight-line distance between square centers (this includes the square your opponent is in). Move to that square.
Pick any square that's further from your opponent's piece than the square you're in now, measured using straight-line distance between square centers. Move to that square.
If you are on a corner square (1, 3, 7, or 9) move to any other corner square. Otherwise, move to square 5.
If you are on an edge square (2, 4, 6, or 8) move to any other edge square. Otherwise, move to square 5.
Indirect movement rules (may be chosen instead of a direct movement rule; at most one per game):
Move using one of the other three movement rules selected in your game, and in addition, your opponent may not use that rule on their next turn (nor may they select it via an indirect rule like this one).
Select two of the other three movement rules, declare them, and then move as if you had used one and then the other, applying any additional effects of both rules in order.
Move using one of the other three movement rules selected in your game, but if the move would cause your piece to move off the board, instead of staying in place move to square 5 (in the middle).
Pick one of the other three movement rules selected in your game and apply it, but move your opponent's piece instead of your own piece. If that movement rule says to move "your opponent's piece," instead apply that movement to your own piece. References to "your position" and "your opponent's position" are swapped when applying the chosen rule, as are references to "your turn" and "your opponent's turn" and do on.
#Game #GameDesign

Estimating CO$_2$ emissions of distributed applications and platforms with SimGrid/Batsim
Gabriella Saraiva (EACH), Miguel Vasconcelos (UT, IRIT-SEPIA, IRIT, Toulouse INP, UT3, CNRS), Sarita Mazzini Bruschi (ICMC-USP), Danilo Carastan-Santos (DATAMOVE, UGA UFR IM2AG, CNRS, LIG), Daniel Cordeiro (EACH)
https://arxiv.org/abs/2508.13693

Estimating CO$_2$ emissions of distributed applications and platforms with SimGrid/Batsim
This work presents a carbon footprint plugin designed to extend the capabilities of the Batsim simulator by allowing the calculation of CO$_2$ emissions during simulation runs. The goal is to comprehensively assess the environmental impact associated with task and resource management strategies in data centers. The plugin is developed within SimGrid -- the underlying simulation framework of Batsim -- and computes carbon emissions based on the simulated platform's energy consumption and carbon i…

A Production-Ready Machine Learning System for Inclusive Employment: Requirements Engineering and Implementation of AI-Driven Disability Job Matching Platform
Oleksandr Kuznetsov, Michele Melchiori, Emanuele Frontoni, Marco Arnesano
https://arxiv.org/abs/2508.11713

A Production-Ready Machine Learning System for Inclusive Employment: Requirements Engineering and Implementation of AI-Driven Disability Job Matching Platform
Employment inclusion of people with disabilities remains critically low in Italy, with only 3.5% employed nationally despite mandatory hiring quotas. Traditional manual matching processes require 30-60 minutes per candidate, creating bottlenecks that limit service capacity. Our goal is to develop and validate a production-ready machine learning system for disability employment matching that integrates social responsibility requirements while maintaining human oversight in decision-making. We em…

How the 49ers accomplished GM John Lynch's goal of getting younger and cheaper for the 2025 season

https://www.cbssports.com/nfl/news/how-the…

Goal-Oriented Low-Rank Tensor Decompositions for Numerical Simulation Data
Daniel M. Dunlavy, Eric T. Phipps, Hemanth Kolla, John N. Shadid, Edward Phillips
https://arxiv.org/abs/2508.11139

Goal-Oriented Low-Rank Tensor Decompositions for Numerical Simulation Data
We introduce a new low-dimensional model of high-dimensional numerical simulation data based on low-rank tensor decompositions. Our new model aims to minimize differences between the model data and simulation data as well as functions of the model data and functions of the simulation data. This novel approach to dimensionality reduction of simulation data provides a means of directly incorporating quantities of interests and invariants associated with conservation principles associated with the…

Letter from the House Democrats to the new interim #NASA administrator observing "a fringe, extremist ideology emanating from the White House Office of Management and Budget" and expressing "nothing but contempt for its goal of dismantling our nation’s space agency": https://democrats-science.house.gov/imo/media/doc/SST RM Lofgren and Foushee - Letter to Interim Administrator Duffy - FY 25 Impoundments - 7.16.25.pdf

OVSegDT: Segmenting Transformer for Open-Vocabulary Object Goal Navigation
Tatiana Zemskova, Aleksei Staroverov, Dmitry Yudin, Aleksandr Panov
https://arxiv.org/abs/2508.11479 h…

OVSegDT: Segmenting Transformer for Open-Vocabulary Object Goal Navigation
Open-vocabulary Object Goal Navigation requires an embodied agent to reach objects described by free-form language, including categories never seen during training. Existing end-to-end policies overfit small simulator datasets, achieving high success on training scenes but failing to generalize and exhibiting unsafe behaviour (frequent collisions). We introduce OVSegDT, a lightweight transformer policy that tackles these issues with two synergistic components. The first component is the semanti…

Multivariate and Multiple Contrast Testing in General Covariate-adjusted Factorial Designs
Marl\'ene Baumeister, Konstantin Emil Thiel, Lynn Matits, Georg Zimmermann, Markus Pauly, Paavo Sattler
https://arxiv.org/abs/2506.15292

Multivariate and Multiple Contrast Testing in General Covariate-adjusted Factorial Designs
Evaluating intervention effects on multiple outcomes is a central research goal in a wide range of quantitative sciences. It is thereby common to compare interventions among each other and with a control across several, potentially highly correlated, outcome variables. In this context, researchers are interested in identifying effects at both, the global level (across all outcome variables) and the local level (for specific variables). At the same time, potential confounding must be accounted f…

Proximal Operators of Sorted Nonconvex Penalties
Anne Gagneux, Mathurin Massias, Emmanuel Soubies
https://arxiv.org/abs/2506.15315 https://

Proximal Operators of Sorted Nonconvex Penalties
This work studies the problem of sparse signal recovery with automatic grouping of variables. To this end, we investigate sorted nonsmooth penalties as a regularization approach for generalized linear models. We focus on a family of sorted nonconvex penalties which generalizes the Sorted L1 Norm (SLOPE). These penalties are designed to promote clustering of variables due to their sorted nature, while the nonconvexity reduces the shrinkage of coefficients. Our goal is to provide efficient ways t…

Prospects for $P$ and $C\!P$ violation in $\Lambda_{c}^{ }$ decays with polarized beam at Super Tau-Charm Facility
Hong-Jian Wang, Cheng Wang, Hao Sun, Pei-Rong Li, Xiao-Rui Lyu, Rong-Gang Ping
https://arxiv.org/abs/2508.12217

Prospects for $P$ and $C\!P$ violation in $Λ_{c}^{+}$ decays with polarized beam at Super Tau-Charm Facility
Weak decays of the charmed baryons offer an ideal platform to study parity ($P$) and charge conjugation-parity ($C\!P$) violation in quark sector, to stringently test the Standard Model and search for new physics. It is a key goal in the next-generation positron-electron collider, such as the Super Tau-Charm Facility (STCF). Thanks to the quantum-entangled pair production with super high luminosity and the possibility of beam polarization, STCF provides a unique environment to probe such symmet…

Weighted Partition Vertex and Edge Cover
Rajni Dabas, Samir Khuller, Emilie Rivkin
https://arxiv.org/abs/2508.13055 https://arxiv.org/pdf/2508.13055…

Weighted Partition Vertex and Edge Cover
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a minimum-weight subset of vertices such that, in each group, the total weight (profit) of covered edges meets a specified threshold. This formula…

A Generalized Multidimensional Chinese Remainder Theorem (MD-CRT) for Multiple Integer Vectors
Guangpu Guo, Xiang-Gen Xia
https://arxiv.org/abs/2508.12099 https://

A Generalized Multidimensional Chinese Remainder Theorem (MD-CRT) for Multiple Integer Vectors
Chinese remainder theorem (CRT) is widely applied in cryptography, coding theory, and signal processing. It has been extended to the multidimensional CRT (MD-CRT), which reconstructs an integer vector from its vector remainders modulo multiple integer matrices. This paper investigates a generalized MD-CRT for multiple integer vectors, where the goal is to determine multiple integer vectors from multiple vector residue sets modulo multiple integer matrices.Comparing to the existing generalized C…

Delta plans for 20% of its fares to be individually determined using AI by the end of 2025, up from 3% now, with the goal of eliminating static pricing entirely (Irina Ivanova/Fortune)
https://fortune.com/2025/07/16/delt…

Delta moves toward eliminating set prices in favor of AI that determines how much you personally will pay for a ticket
The airline touted a partnership with an AI-enabled revenue system as a step on the road to fully personalized ticket pricing, part of its goal to raise profit margins long-term.

Design of MIMO Lur'e oscillators via dominant system theory with application in multi-agent rhythm synchronization
Yu Kawano, Fulvio Forni
https://arxiv.org/abs/2508.12141 h…

Design of MIMO Lur'e oscillators via dominant system theory with application in multi-agent rhythm synchronization
This paper presents a new design framework for dynamic output-feedback controllers for Lur'e oscillation in a multiple-input multiple-output setting. We first revisit and extend dominant system theory to state-dependent rates, with the goal of deriving conditions based on linear matrix inequalities. Then, we introduce a separation principle for Lur'e oscillator design, which allows for the independent design of a state-feedback oscillator and an observer. Our proposed control synthesis is demon…

Estimates for pseudo-differential operators on the torus revisited. III
Duv\'an Cardona, Manuel Mart\'inez
https://arxiv.org/abs/2508.13338 https://

Estimates for pseudo-differential operators on the torus revisited. III
This paper finishes the goal of the authors started in two previous manuscripts dedicated to revisiting the continuity properties of toroidal pseudo-differential operators with symbols in the Hörmander classes. Here we prove pointwise estimates in terms of the Fefferman-Stein sharp maximal function and of the Hardy-Littlewood maximal function. Combining these estimates with the properties of Muckenhoupt's weight class $A_p$ we obtain boundedness theorems for pseudo-differential operators betwe…

A Mechanism for Mutual Fairness in Cooperative Games with Replicable Resources -- Extended Version
Bj\"orn Filter, Ralf M\"oller, \"Ozg\"ur L\"utf\"u \"Oz\c{c}ep
https://arxiv.org/abs/2508.13960

A Mechanism for Mutual Fairness in Cooperative Games with Replicable Resources -- Extended Version
The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A major challenge in designing such systems is to guarantee safety and alignment with human values, particularly a fair distribution of rewards upon achieving the global goal. Cooperative game theory offers useful abstractions of cooperating agents via value funct…

Ultrafast Nonequilibrium Enhancement of Electron-Phonon Interaction in 2H-MoTe$_2$
Nina Girotto Erhardt, Sotirios Fragkos, Dominique Descamps, St\'ephane Petit, Michael Sch\"uler, Dino Novko, Samuel Beaulieu
https://arxiv.org/abs/2508.12239

Ultrafast Nonequilibrium Enhancement of Electron-Phonon Interaction in 2H-MoTe$_2$
Understanding nonequilibrium electron-phonon interactions at the microscopic level and on ultrafast timescales is a central goal of modern condensed matter physics. Combining time- and angle-resolved extreme ultraviolet photoemission spectroscopy with constrained density functional perturbation theory, we demonstrate that photoexcited carrier density can serve as a tuning knob to enhance electron-phonon interactions in nonequilibrium conditions. Specifically, nonequilibrium band structure mappi…

My next upskilling goal... shader coding.
#GameDev

How Convective Mass Flux Responds to Environmental Humidity
Seth D. Seidel, Nathan P. Arnold, Brandon Wolding
https://arxiv.org/abs/2506.14962 https://

How Convective Mass Flux Responds to Environmental Humidity
Our goal in this study is to characterize the relationship between lower tropospheric environmental humidity and convective mass flux in the tropics. To do so, we have created gridded convective mass flux datasets from five global storm-resolving models (GSRMs). We have three principal findings. First, in humid environments, mass flux increases with height from the surface through the depth of the lower free troposphere, forming a ``deep-inflow". In dry environments, mass flux decreases with he…

An Efficient Network-aware Direct Search Method for Influence Maximization
Matteo Bergamaschi, Sara Venturini, Francesco Tudisco, Francesco Rinaldi
https://arxiv.org/abs/2508.12164

An Efficient Network-aware Direct Search Method for Influence Maximization
Influence Maximization (IM) is a pivotal concept in social network analysis, involving the identification of influential nodes within a network to maximize the number of influenced nodes, and has a wide variety of applications that range from viral marketing and information dissemination to public health campaigns. IM can be modeled as a combinatorial optimization problem with a black-box objective function, where the goal is to select $B$ seed nodes that maximize the expected influence spread.…

This paragraph from Peopleware (in Chapter 21, under subheading "Management by Hysterical Optimism") is one I think about a lot.

Donald Trump on Sunday directed federal immigration officials to prioritize deportations from Democratic-run cities,
a move that comes after large protests erupted in Los Angeles and other major cities against the Trump administration’s immigration policies.
Trump in a social media posting called on U.S. Immigration and Customs Enforcement officials
“to do all in their power to achieve the very important goal of delivering the single largest Mass Deportation Program in Hist…

Trump directs ICE to prioritize deportations from Democratic-run cities
President Donald Trump has directed federal immigration officials to prioritize deportations from Democratic-run cities after large protests have erupted in Los Angeles and other major cities against the Trump administration’s immigration policies. Trump in a social media posting Sunday called on ICE officials “to do all in their power to achieve the very important goal of delivering the single largest Mass Deportation Program in History.” He added that to reach the goal officials ”must…

Putting the social cost of carbon at a modest $100 per tonne of CO2, the Trump regime will cause $700 billion of additional climate damage until 2030, and a lot more thereafter.
https://www.carbonbrief.org/chart-trumps-big-beautif…

Chart: Trump’s ‘big beautiful bill’ blows US emissions goal by 7bn tonnes - Carbon Brief
Donald Trump’s dismantling of climate policy means the US will add an extra 7bn tonnes of emissions to the atmosphere from now until 2030.

Nano-resolved sensing of 3D electromagnetic fields via single emitters' extreme variation of enhanced spontaneous emission
R. Margoth C\'ordova-Castro, Dirk Jonker, Cl\'ement Cabriel, Mario Zapata-Herrera, Bart van Dam, Yannick De Wilde, Robert W. Boyd, Arturo Susarrey-Arce, Ignacio Izeddin, Valentina Krachmalnicoff
https://

Nano-resolved sensing of 3D electromagnetic fields via single emitters' extreme variation of enhanced spontaneous emission
Controlling quantum light-matter interactions at scales smaller than the diffraction limit at the single quantum emitter level is a critical challenge to the goal of advancing quantum technologies. We introduce a novel material platform that enables precise engineering of spontaneous emission changes in molecular single emitters through 3D nanofields. This platform is based on a 3D hollow plasmonic nanomaterial arranged in a square lattice, uniformly scalable to the centimeter scale while maint…

Reasoning with Exploration: An Entropy Perspective
Daixuan Cheng, Shaohan Huang, Xuekai Zhu, Bo Dai, Wayne Xin Zhao, Zhenliang Zhang, Furu Wei
https://arxiv.org/abs/2506.14758

Reasoning with Exploration: An Entropy Perspective
Balancing exploration and exploitation is a central goal in reinforcement learning (RL). Despite recent advances in enhancing language model (LM) reasoning, most methods lean toward exploitation, and increasingly encounter performance plateaus. In this work, we revisit entropy -- a signal of exploration in RL -- and examine its relationship to exploratory reasoning in LMs. Through empirical analysis, we uncover strong positive correlations between high-entropy regions and three types of explora…

Dark Count Rate Stability of JUNO 20-inch PMTs in Mass Testing
Min Li, Narongkiat Rodphai, Caimei Liu, Zhimin Wang, Zhaoyuan Peng, Jun Wang, Nikolay Anfimov, Denis Korablev, Tobias Lachenmaier, Alexander G. Olshevskiy, Zhonghua Qin, Tobias Sterr, Alexander Felix Tietzsch, Rong Zhao, Wei Wang, Kaile Wen, Bjoern Soenke Wonsak, Wan Xie, Meihang Xu, Yu Zhang

Dark Count Rate Stability of JUNO 20-inch PMTs in Mass Testing
The Jiangmen Underground Neutrino Observatory (JUNO) is an ambitious multipurpose neutrino experiment designed to determine the neutrino mass ordering, with an impressive energy resolution goal of at least 3% at 1 MeV. To achieve a photon detection coverage of approximately 75%, JUNO will utilize two types of 20-inch photomultiplier tubes (PMTs): the large PMT (LPMT) and the microchannel plate PMT (MCP-PMT). A significant concern in high-precision neutrino measurements is the dark count rate (D…

An optimal experimental design approach to sensor placement in continuous stochastic filtering
Sahani Pathiraja, Claudia Schillings, Philipp Wacker
https://arxiv.org/abs/2508.12288

An optimal experimental design approach to sensor placement in continuous stochastic filtering
Sequential filtering and spatial inverse problems assimilate data points distributed either temporally (in the case of filtering) or spatially (in the case of spatial inverse problems). Sometimes it is possible to choose the position of these data points (which we call sensors here) in advance, with the goal of maximising the expected information gain (or a different metric of performance) from future data, and this leads to an Optimal Experimental Design (OED) problem. Here we revisit an inter…

The Economic Value of Depth
Pedro Afonso Fernandes
https://arxiv.org/abs/2506.15354 https://arxiv.org/pdf/2506.15354

The Economic Value of Depth
The main goal of this article is to introduce an economic perspective in the social logic of space. Firstly, we describe the economic model of a linear city to show how depth can generate value by creating local monopolies in less integrated spaces. Then, a new syntactic measure, the d-value, is proposed to capture the relation between the depth of some space from outside and the mean depth of all spaces from outside. An application to a public housing estate suggests that economic activities a…

Surface sums in two-dimensional large-$N$ lattice Yang--Mills: Cancellations and explicit computation for general loops
Jacopo Borga, Sky Cao, Jasper Shogren-Knaak
https://arxiv.org/abs/2508.13827

Surface sums in two-dimensional large-$N$ lattice Yang--Mills: Cancellations and explicit computation for general loops
In the context of two-dimensional large-$N$ lattice Yang--Mills theory, we perform a refined study of the surface sums defined in the companion work [BCSK24]. In this setting, the surface sums are a priori expected to exhibit significant simplifications, because two-dimensional Yang--Mills theory is a special model admitting many known exact formulas. Thus, a natural problem is to understand these simplifications directly from the perspective of the surface sums. Towards this goal, we develop a…

Overcoming Knowledge Discrepancies: Structuring Reasoning Threads through Knowledge Balancing in Interactive Scenarios
Daniel Burkhardt, Xiangwei Cheng
https://arxiv.org/abs/2508.12100

Overcoming Knowledge Discrepancies: Structuring Reasoning Threads through Knowledge Balancing in Interactive Scenarios
Reasoning in interactive problem solving scenarios requires models to construct reasoning threads that reflect user understanding and align with structured domain knowledge. However, current reasoning models often lack explicit semantic hierarchies, user-domain knowledge alignment, and principled mechanisms to prune reasoning threads for effectiveness. These limitations result in lengthy generic output that does not guide users through goal-oriented reasoning steps. To address this, we propose …

The properties of the nitrogen-vacancy center in milled chemical vapor deposition nanodiamonds
Alessandro Mameli, Giannis Thalassinos, Marco Capelli, Johannes Ackermann, Edwin Mayes, Hiroshi Abe, Takeshi Ohshima, Tingpeng Luo, Volker Cimalla, Peter Knittel, Brant Gibson, Jan Jeske, Nikolai Dontschuk, Anke Krueger, Alastair Stacey, Alexander Healey, Philipp Reineck

The properties of the nitrogen-vacancy center in milled chemical vapor deposition nanodiamonds
Fluorescent nanodiamonds (FNDs) containing negatively charged nitrogen-vacancy (NV-) centers are vital for many emerging quantum sensing applications from magnetometry to intracellular sensing in biology. However, developing a scalable fabrication method for FNDs hosting color centers with consistent bulk-like photoluminescence (PL) and spin coherence properties remains a highly desired but unrealized goal. Here, we investigate optimized ball milling of single-crystal diamonds produced via chem…

Highlight: Tyler Loop Extends Ravens' Lead With 53-yard Field Goal https://www.baltimoreravens.com/video/tyler-loop-ravens-cowboys-field-goal-late-lead-preseason-highlight

Dependence bounds for the difference of stop-loss payoffs on the difference of two random variables
Hamza Hanbali, Jan Dhaene, Daniel Linders
https://arxiv.org/abs/2508.12606 ht…

Dependence bounds for the difference of stop-loss payoffs on the difference of two random variables
This paper considers the difference of stop-loss payoffs where the underlying is a difference of two random variables. The goal is to study whether the comonotonic and countermonotonic modifications of those two random variables can be used to construct upper and lower bounds for the expected payoff, despite the fact that the payoff function is neither convex nor concave. The answer to the central question of the paper requires studying the crossing points of the cdf of the original difference …

Efficient Qudit Circuit for Quench Dynamics of $2 1$D Quantum Link Electrodynamics
Rohan Joshi, Michael Meth, Jan C. Louw, Jesse J. Osborne, Kevin Mato, Martin Ringbauer, Jad C. Halimeh
https://arxiv.org/abs/2507.12589

Efficient Qudit Circuit for Quench Dynamics of $2+1$D Quantum Link Electrodynamics
A major challenge in the burgeoning field of quantum simulation for high-energy physics is the realization of scalable $2+1$D lattice gauge theories on state-of-the-art quantum hardware, which is an essential step towards the overarching goal of probing $3+1$D quantum chromodynamics on a quantum computer. Despite great progress, current experimental implementations of $2+1$D lattice gauge theories are mostly restricted to relatively small system sizes and two-level representations of the gauge …

Yeah! #peertube overachieved!
Thanks for everyone donating!
https://support.joinpeertube.org/en/

Niners LT Trent Williams on goal of playing till he’s 40: ‘Not going to retire with something left on the table’ https://www.nfl.com/news/niners-lt-trent-williams-on-goal-of-playing-till-he-s-40-not-g…

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

What a delightful pass for the assist. Fooled me, as I thought it was coming to the top of the box. Instead Bonmati chops it back downward towards goal and it's an open and unhurried opportunity.
Now Switzerland will have to take some risks. The tactics, at present, seem to be to bomb it downfield and let Pilgrim run.
#ESPSUI

An Elliptic-Parabolic Free Boundary Problem with Discontinuous Data
Dennis Kriventsov, Mar\'ia Soria-Carro
https://arxiv.org/abs/2508.13299 https://arx…

An Elliptic-Parabolic Free Boundary Problem with Discontinuous Data
We consider an elliptic-parabolic free boundary problem that models the fluid flow through a partially saturated porous medium. The free boundary arises as the interface separating the saturated and unsaturated regions. Our main goal is to investigate, for the 1+1 dimensional model, how jump discontinuities on the boundary and initial data influence the regularity of both the solution and the free boundary. We show that if the data is merely bounded, then weak solutions are Lipschitz in space a…

Kyler Murray, Cardinals offense emphasize improving QB scrambles https://www.espn.com/nfl/story/_/id/45531726/arizona-cardinals-kyler-murray-offense-scrambles

Thanks to your incredible support, we've made it to €4889! 💙 Our goal is €12,439 to continue the fight for justice. Every donation matters in pushing this cause ahead. Thank you for standing with us! 🙏 Find out more and donate here: https://chardonsbleus.org/donate

The Multi-Stage Assignment Problem: A Fairness Perspective
Vibulan J, Swapnil Dhamal, Shweta Jain
https://arxiv.org/abs/2508.13856 https://arxiv.org/pdf/25…

The Multi-Stage Assignment Problem: A Fairness Perspective
This paper explores the problem of fair assignment on Multi-Stage graphs. A multi-stage graph consists of nodes partitioned into $K$ disjoint sets (stages) structured as a sequence of weighted bipartite graphs formed across adjacent stages. The goal is to assign node-disjoint paths to $n$ agents starting from the first stage and ending in the last stage. We show that an efficient assignment that minimizes the overall sum of costs of all the agents' paths may be highly unfair and lead to signifi…

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
Richard Waldinger
https://arxiv.org/abs/2508.11136 https://

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
The unification algorithm has long been a target for program synthesis research, but a fully automatic derivation remains a research goal. In deductive program synthesis, computer programming is phrased as a task in theorem proving; a declarative specification is expressed in logical form and presented to an automatic theorem prover, and a program meeting the specification is extracted from the proof. The correctness of the program is supported by the proof, which also provides an explanation o…

CoDiEmb: A Collaborative yet Distinct Framework for Unified Representation Learning in Information Retrieval and Semantic Textual Similarity
Bowen Zhang, Zixin Song, Chunquan Chen, Qian-Wen Zhang, Di Yin, Xing Sun
https://arxiv.org/abs/2508.11442

CoDiEmb: A Collaborative yet Distinct Framework for Unified Representation Learning in Information Retrieval and Semantic Textual Similarity
Learning unified text embeddings that excel across diverse downstream tasks is a central goal in representation learning, yet negative transfer remains a persistent obstacle. This challenge is particularly pronounced when jointly training a single encoder for Information Retrieval (IR) and Semantic Textual Similarity (STS), two essential but fundamentally disparate tasks for which naive co-training typically yields steep performance trade-offs. We argue that resolving this conflict requires sys…

Anticipating Bugs: Ticket-Level Bug Prediction and Temporal Proximity Effects
Daniele La Prova, Emanuele Gentili, Davide Falessi
https://arxiv.org/abs/2506.14290

Anticipating Bugs: Ticket-Level Bug Prediction and Temporal Proximity Effects
The primary goal of bug prediction is to optimize testing efforts by focusing on software fragments, i.e., classes, methods, commits (JIT), or lines of code, most likely to be buggy. However, these predicted fragments already contain bugs. Thus, the current bug prediction approaches support fixing rather than prevention. The aim of this paper is to introduce and evaluate Ticket-Level Prediction (TLP), an approach to identify tickets that will introduce bugs once implemented. We analyze TLP at t…

NemeSys: An Online Underwater Explorer with Goal-Driven Adaptive Autonomy
Adnan Abdullah, Alankrit Gupta, Vaishnav Ramesh, Shivali Patel, Md Jahidul Islam
https://arxiv.org/abs/2507.11889

NemeSys: An Online Underwater Explorer with Goal-Driven Adaptive Autonomy
Adaptive mission control and dynamic parameter reconfiguration are essential for autonomous underwater vehicles (AUVs) operating in GPS-denied, communication-limited marine environments. However, most current AUV platforms execute static, pre-programmed missions or rely on tethered connections and high-latency acoustic channels for mid-mission updates, significantly limiting their adaptability and responsiveness. In this paper, we introduce NemeSys, a novel AUV system designed to support real-t…

Chargers' Tuli Tuipulotu aims to mirror Khalil Mack's play in full-time starter role: 'He's the standard' https://www.nfl.com/news/chargers-tuli-tuipulotu-aims-to-mirror-khalil-mack-s-play-in-full-ti…

Enhancing Symbolic Machine Learning by Subsymbolic Representations
Stephen Roth, Lennart Baur, Derian Boer, Stefan Kramer
https://arxiv.org/abs/2506.14569 …

Enhancing Symbolic Machine Learning by Subsymbolic Representations
The goal of neuro-symbolic AI is to integrate symbolic and subsymbolic AI approaches, to overcome the limitations of either. Prominent systems include Logic Tensor Networks (LTN) or DeepProbLog, which offer neural predicates and end-to-end learning. The versatility of systems like LTNs and DeepProbLog, however, makes them less efficient in simpler settings, for instance, for discriminative machine learning, in particular in domains with many constants. Therefore, we follow a different approach:…

We can give up a 4v2 goal, but Mo can score a 1v4 goal. How about it?
🇪🇬 👑
#LFC

“I’m increasingly concerned with the growing cases of people in the United States
who have fled oppressive regimes
and are being detained and held for possible deportation,“
said Diaz-Balart, on X.
"Cases like Sanabria’s,
and so many others with legitimate claims of persecution,
require a thorough review.”
The letter from Diaz-Balart is the latest example of Miami Republicans pushing back against Trump’s immigration agenda,
the goal of w…

Jaguars' Cam Little sends jersey, cleat from 70-yard preseason field goal to Hall of Fame https://www.nfl.com/news/cam-little-sends-jersey-cleat-from-70-yard-preseason-field-goal-to-hall-of-fame

Thanks to you, we’ve raised €10.064 ! Our goal: €12,439 to keep pushing this legal battle forward. Thank you for your generosity! 💙 👉 https://chardonsbleus.org/donate

Feedforward Ordering in Neural Connectomes via Feedback Arc Minimization
Soroush Vahidi
https://arxiv.org/abs/2506.13799 https://arxi…

Feedforward Ordering in Neural Connectomes via Feedback Arc Minimization
We present a suite of scalable algorithms for minimizing feedback arcs in large-scale weighted directed graphs, with the goal of revealing biologically meaningful feedforward structure in neural connectomes. Using the FlyWire Connectome Challenge dataset, we demonstrate the effectiveness of our ranking strategies in maximizing the total weight of forward-pointing edges. Our methods integrate greedy heuristics, gain-aware local refinements, and global structural analysis based on strongly connec…

Top draft pick Jihaad Campbell gives update on Eagles return, has simple goal as he prepares for rookie season

https://www.cbssports.com/nfl/news/top-d…

Versatile and Generalizable Manipulation via Goal-Conditioned Reinforcement Learning with Grounded Object Detection
Huiyi Wang, Fahim Shahriar, Alireza Azimi, Gautham Vasan, Rupam Mahmood, Colin Bellinger
https://arxiv.org/abs/2507.10814

Versatile and Generalizable Manipulation via Goal-Conditioned Reinforcement Learning with Grounded Object Detection
General-purpose robotic manipulation, including reach and grasp, is essential for deployment into households and workspaces involving diverse and evolving tasks. Recent advances propose using large pre-trained models, such as Large Language Models and object detectors, to boost robotic perception in reinforcement learning. These models, trained on large datasets via self-supervised learning, can process text prompts and identify diverse objects in scenes, an invaluable skill in RL where learnin…

Dak Prescott makes goal clear about Dallas Cowboys, NFL legacy https://www.si.com/nfl/cowboys/news/dak-prescott-makes-goal-clear-about-dallas-cowboys-nfl-legacy

Sweden really putting pressure on the England back line. Good press for the first goal. Exposed the high line to pace on the second.
England, now facing a big deficit, will have to push forward more aggressively. This will continue to expose the vulnerable high line to further sprints in behind. Sweden certainly has pace.
#SWEENG

Landmark-Assisted Monte Carlo Planning
David H. Chan, Mark Roberts, Dana S. Nau
https://arxiv.org/abs/2508.11493 https://arxiv.org/pdf/2508.11493

Landmark-Assisted Monte Carlo Planning
Landmarks$\unicode{x2013}$conditions that must be satisfied at some point in every solution plan$\unicode{x2013}$have contributed to major advancements in classical planning, but they have seldom been used in stochastic domains. We formalize probabilistic landmarks and adapt the UCT algorithm to leverage them as subgoals to decompose MDPs; core to the adaptation is balancing between greedy landmark achievement and final goal achievement. Our results in benchmark domains show that well-chosen la…

Eagles OL Landon Dickerson to undergo minor procedure on knee; goal is to be ready for Week 1 https://www.nfl.com/news/eagles-ol-landon-dickerson-to-undergo-minor-procedure-on-knee-goal-is-to-be-ready-for-week-1

DynaGuide: Steering Diffusion Polices with Active Dynamic Guidance
Maximilian Du, Shuran Song
https://arxiv.org/abs/2506.13922 https://

DynaGuide: Steering Diffusion Polices with Active Dynamic Guidance
Deploying large, complex policies in the real world requires the ability to steer them to fit the needs of a situation. Most common steering approaches, like goal-conditioning, require training the robot policy with a distribution of test-time objectives in mind. To overcome this limitation, we present DynaGuide, a steering method for diffusion policies using guidance from an external dynamics model during the diffusion denoising process. DynaGuide separates the dynamics model from the base pol…

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Sangwoo Jeon, Juchul Shin, Gyeong-Tae Kim, YeonJe Cho, Seongwoo Kim
https://arxiv.org/abs/2508.10747

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Generalized planning using deep reinforcement learning (RL) combined with graph neural networks (GNNs) has shown promising results in various symbolic planning domains described by PDDL. However, existing approaches typically represent planning states as fully connected graphs, leading to a combinatorial explosion in edge information and substantial sparsity as problem scales grow, especially evident in large grid-based environments. This dense representation results in diluted node-level infor…

GRaD-Nav : Vision-Language Model Enabled Visual Drone Navigation with Gaussian Radiance Fields and Differentiable Dynamics
Qianzhong Chen, Naixiang Gao, Suning Huang, JunEn Low, Timothy Chen, Jiankai Sun, Mac Schwager
https://arxiv.org/abs/2506.14009

GRaD-Nav++: Vision-Language Model Enabled Visual Drone Navigation with Gaussian Radiance Fields and Differentiable Dynamics
Autonomous drones capable of interpreting and executing high-level language instructions in unstructured environments remain a long-standing goal. Yet existing approaches are constrained by their dependence on hand-crafted skills, extensive parameter tuning, or computationally intensive models unsuitable for onboard use. We introduce GRaD-Nav++, a lightweight Vision-Language-Action (VLA) framework that runs fully onboard and follows natural-language commands in real time. Our policy is trained …

Jaguars' Little nails would-be-record 70-yard FG https://www.espn.com/nfl/story/_/id/45934622/jaguars-kicker-cam-little-nails-70-yard-field-goal

Pro Football Hall of Fame requests Cam Little's jersey and cleat after his historic 70-yard field goal

https://www.cbssports.com/nfl/news/pro-foo

Efficient Online Learning and Adaptive Planning for Robotic Information Gathering Based on Streaming Data
Sanjeev Ramkumar Sudha, Joel Jose, Erlend M. Coates
https://arxiv.org/abs/2507.13053

Efficient Online Learning and Adaptive Planning for Robotic Information Gathering Based on Streaming Data
Robotic information gathering (RIG) techniques refer to methods where mobile robots are used to acquire data about the physical environment with a suite of sensors. Informative planning is an important part of RIG where the goal is to find sequences of actions or paths that maximize efficiency or the quality of information collected. Many existing solutions solve this problem by assuming that the environment is known in advance. However, real environments could be unknown or time-varying, and a…

Jaguars kicker Cam Little booms 70-yard field goal vs. Steelers https://www.nfl.com/news/jaguars-kicker-cam-little-booms-70-yard-field-goal-vs-steelers

Cam Little's improbable 70-yard kick for Jaguars appears to be longest field goal in football history

https://www.cbssports.com/nfl/news/cam-lit

Rashod Bateman believes Zay Flowers could 'easily' get 1,300 receiving yards but that isn't Ravens' goal https://www.nfl.com/news/rashod-bateman-believes-zay-flowers-could-easily-get-1-300-receiving-yard…

Has Cam Little's 70-yard FG convinced the Jaguars to let him try again? https://www.espn.com/nfl/story/_/id/45959074/jacksonville-jaguars-cam-little-70-yard-field-goal-season