Zobrazeno 1 - 10
of 1 365
pro vyhledávání: '"Jensen, David A."'
Mechanistic interpretability aims to understand the inner workings of large neural networks by identifying circuits, or minimal subgraphs within the model that implement algorithms responsible for performing specific tasks. These circuits are typical
Externí odkaz:
http://arxiv.org/abs/2411.16105
Autor:
Jensen, David, Laboy, Doel Rivera
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians of such g
Externí odkaz:
http://arxiv.org/abs/2408.09247
Autor:
Jensen, David W.
Designing for rotational stability can dramatically affect the geometry of a space station. If improperly designed, the rotating station could end up catastrophically tumbling end-over-end. Active stabilization can address this problem; however, desi
Externí odkaz:
http://arxiv.org/abs/2408.00155
Autor:
Jensen, David W.
As the space industry matures, large space stations will be built. This paper organizes and documents constraints on the size of these space stations. Human frailty, station design, and construction impose these constraints. Human limitations include
Externí odkaz:
http://arxiv.org/abs/2408.00152
Autor:
Pruthi, Purva, Jensen, David
Many real-world systems can be represented as sets of interacting components. Examples of such systems include computational systems such as query processors, natural systems such as cells, and social systems such as families. Many approaches have be
Externí odkaz:
http://arxiv.org/abs/2406.17714
A Ferrers rook graph is a graph whose vertices correspond to the dots in a Ferrers diagram, and where two vertices are adjacent if they are in the same row or the same column. We propose a conjectural formula for the gonality of Ferrers rook graphs,
Externí odkaz:
http://arxiv.org/abs/2405.07947
Autor:
Chuck, Caleb, Vaidyanathan, Sankaran, Giguere, Stephen, Zhang, Amy, Jensen, David, Niekum, Scott
Reinforcement learning (RL) algorithms often struggle to learn policies that generalize to novel situations due to issues such as causal confusion, overfitting to irrelevant factors, and failure to isolate control of state factors. These issues stem
Externí odkaz:
http://arxiv.org/abs/2404.10883
Autor:
Proudfoot, Benjamin C. N., Ragozzine, Darin A., Thatcher, Meagan L., Grundy, Will, Spencer, Dallin J., Alailima, Tahina M., Allen, Sawyer, Bowden, Penelope C., Byrd, Susanne, Camacho, Conner D., Campbell, Gibson H., Carlisle, Edison P., Christensen, Jacob A., Christensen, Noah K., Clement, Kaelyn, Derieg, Benjamin J., Dille, Mara K., Dorrett, Cristian, Ellefson, Abigail L., Fleming, Taylor S., Freeman, N. J., Gibson, Ethan J., Giforos, William G., Guerrette, Jacob A., Haddock, Olivia, Hammond, S. Ashton, Hampson, Zachary A., Hancock, Joshua D., Harmer, Madeline S., Henderson, Joseph R., Jensen, Chandler R., Jensen, David, Jensen, Ryleigh E., Jones, Joshua S., Kubal, Cameron C., Lunt, Jacob N., Martins, Stephanie, Matheson, McKenna, Maxwell, Dahlia, Morrell, Timothy D., Myckowiak, McKenna M., Nelsen, Maia A., Neu, Spencer T., Nuccitelli, Giovanna G., Reardon, Kayson M., Reid, Austin S., Richards, Kenneth G., Robertson, Megan R. W., Rydalch, Tanner D., Scoresby, Conner B., Scott, Ryan L., Shakespear, Zacory D., Silveira, Elliot A., Steed, Grace C., Suggs, Christiana Z., Suggs, Garrett D., Tobias, Derek M., Toole, Matthew L., Townsend, McKayla L., Vickers, Kade L., Wagner, Collin R., Wright, Madeline S., Zappala, Emma M. A.
Publikováno v:
AJ 167 144 (2024)
About 40 transneptunian binaries (TNBs) have fully determined orbits with about 10 others being solved except for breaking the mirror ambiguity. Despite decades of study almost all TNBs have only ever been analyzed with a model that assumes perfect K
Externí odkaz:
http://arxiv.org/abs/2403.12783
Algorithmic robustness refers to the sustained performance of a computational system in the face of change in the nature of the environment in which that system operates or in the task that the system is meant to perform. Below, we motivate the impor
Externí odkaz:
http://arxiv.org/abs/2311.06275
The $r$th gonality of a graph is the smallest degree of a divisor on the graph with rank $r$. The gonality sequence of a graph is a tropical analogue of the gonality sequence of an algebraic curve. We show that the set of truncated gonality sequences
Externí odkaz:
http://arxiv.org/abs/2306.11118