Searching Entangled Program Spaces by Koppel, James, Guo, Zheng, De Vries, Edsko, Solar-Lezama, Armando, Polikarpova, Nadia

Get full text

Heuristic Search of Multiagent Influence Space by Witwicki, Stefan J., Oliehoek, Frans A., Kaelbling, Leslie P.

“…Multiagent heuristic search gains traction by pruning large portions of the joint policy space deemed suboptimal by heuristic bounds. Alternatively, influence-based abstraction reformulates the search space of joint policies into a smaller space of influences, which represent the probabilistic effects that agents' policies may exert on one another. …”
Get full text
Get full text

Learning embeddings into entropic Wasserstein spaces by Frogner, C, Solomon, J, Mirzazadeh, F

“…Wasserstein spaces are much larger and more flexible than Euclidean spaces, in that they can successfully embed a wider variety of metric structures. …”
Get full text

Stochastic Dynamic Games in Belief Space by Schwarting, Wilko, Pierson, Alyssa, Karaman, Sertac, Rus, Daniela

Get full text

Space-Efficient Local Computation Algorithms by Alon, Noga, Rubinfeld, Ronitt, Vardi, Shai, Xie, Ning

“…In particular, we develop a technique which under certain conditions can be applied to construct local computation algorithms that run not only in polylogarithmic time but also in polylogarithmic space. Moreover, these local computation algorithms are easily parallelizable and can answer all parallel queries consistently. …”
Get full text
Get full text

On the optimal space complexity of consensus for anonymous processes by Gelashvili, Rati

“…Abstract The optimal space complexity of consensus in asynchronous shared memory was an open problem for two decades. …”
Get full text

Learning generative models across incomparable spaces by Bunne, Charlotte, Alvarez Melis, David, Krause, Andreas, Jegelka, Stefanie Sabrina

“…In this work, we propose an approach to learn generative models across such incomparable spaces, and demonstrate how to steer the learned distribution towards target properties. …”
Get full text

Word Embeddings as Metric Recovery in Semantic Spaces by Hashimoto, Tatsunori B, Alvarez-Melis, David, Jaakkola, Tommi S

“…We ground word embeddings in semantic spaces studied in the cognitive-psychometric literature, taking these spaces as the primary objects to recover. …”
Get full text

On the Optimal Time/Space Tradeoff for Hash Tables by Bender, Michael A., Farach-Colton, Mart?n, Kuszmaul, John, Kuszmaul, William, Liu, Mingmou

Get full text

Null-Space Grasp Control: Theory and Experiments by Platt, Robert, Fagg, Andrew H., Grupen, Roderic A.

“…This paper proposes three variations on null-space grasp control: an approach that combines multiple grasp objectives to improve a grasp. …”
Get full text

Kakeya-type sets in finite vector spaces by Saraf, Shubhangi, Kopparty, Swastik, Sudan, Madhu, Lev, Vsevolod F.

“…For a finite vector space V and a nonnegative integer r≤dim V, we estimate the smallest possible size of a subset of V, containing a translate of every r-dimensional subspace. …”
Get full text

Some Results on Greedy Embeddings in Metric Spaces by Moitra, Ankur, Leighton, Frank Thomson

“…Greedy Routing is a natural abstraction of this model in which nodes are assigned virtual coordinates in a metric space, and these coordinates are used to perform point-to-point routing. …”
Get full text
Get full text
Get full text

Integrated task and motion planning in belief space by Kaelbling, Leslie P., Lozano-Perez, Tomas

“…We describe an integrated strategy for planning, perception, state estimation and action in complex mobile manipulation domains based on planning in the belief space of probability distributions over states using hierarchical goal regression (pre-image back-chaining). …”
Get full text
Get full text
Get full text

Non-Gaussian belief space planning: Correctness and complexity by Platt, Robert, Kaelbling, Leslie P, Lozano-Perez, Tomas, Tedrake, Russell L

“…One approach to solving these problems is to create plans in belief-space, the space of probability distributions over the underlying state of the system. …”
Get full text

Belief space planning assuming maximum likelihood observations by Platt, Robert, Tedrake, Russell Louis, Kaelbling, Leslie P., Lozano-Perez, Tomas

“…We cast the partially observable control problem as a fully observable underactuated stochastic control problem in belief space and apply standard planning and control techniques. …”
Get full text
Get full text
Get full text
Get full text

Discovering Structure in the Space of fMRI Selectivity Profiles by Lashkari, Danial, Vul, Edward, Kanwisher, Nancy, Golland, Polina

Get full text
Get full text
Get full text

Scalable Address Spaces Using Rcu Balanced Trees by Clements, Austin T., Kaashoek, M. Frans, Zeldovich, Nickolai

“…Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared address space has a cost: kernel virtual memory operations such as handling soft page faults, growing the address space, mapping files, etc. can limit the scalability of these applications. …”
Get full text
Get full text
Get full text

RadixVM: Scalable address spaces for multithreaded applications by Clements, Austin T., Kaashoek, M. Frans, Zeldovich, Nickolai

“…RadixVM is a new virtual memory system design that enables fully concurrent operations on shared address spaces for multithreaded processes on cache-coherent multicore computers. …”
Get full text
Get full text
Get full text

POMCoP: Belief Space Planning for Sidekicks in Cooperative Games by Macindoe, Owen, Kaelbling, Leslie P., Lozano-Perez, Tomas

“…We demonstrate POMCoP by constructing a sidekick for a cooperative pursuit game, and evaluate its effectiveness relative to MDP-based techniques that plan in state space, rather than belief space.…”
Get full text
Get full text
Get full text

Fast state-space methods for inferring dendritic synaptic connectivity by Pakman, Ari, Smith, Carl, Paninski, Liam, Huggins, Jonathan H.

“…Given noisy, subsampled voltage observations we develop fast l[subscript 1]-penalized regression methods for Kalman state-space models of the neuron voltage dynamics. The value of the l[subscript 1]-penalty parameter is chosen using cross-validation or, for low signal-to-noise ratio, a Mallows’ C[subscript p]-like criterion. …”
Get full text
Get full text