In Praise of Theory in Design Research: How Levi-Strauss Redefined Workflow
Points: 81 | Comments: 33 | Author: kawera
Points: 81 | Comments: 33 | Author: kawera
In this paper we prove that cyclic homology, topological cyclic homology, and algebraic $K$-theory satisfy a pro Mayer--Vietoris property with respect to abstract blow-up squares of varieties, in both zero and finite characteristic. This may be inter...
In the context of three-dimensional conformal higher spin theory we derive, in the frame field formulation, the full non-linear spin 3 Cotton equation coupled to spin 2. This is done by solving the corresponding Chern-Simons gauge theory system of eq...
The quantum theory of ur objects postulates that all existing physical objects and their properties are constructed from fundamental objects called ur objects being described by an element of a two dimensional complex Hilbert space. This approach i...
We argue that traditional Western science cannot adequately describe sports and other types of human behavior. Then we make an argument why a complex adaptive systems approach has the potential to provide the foundation for such a theory. We claim...
After 40 years we have no "low" theory of quasars to predict the atomic absorption and emission features so abundant in quasar spectra. Here I take the first step, using results selected for their diagnostic power to build an "observational paradig...
Direct optimal control theory for quantum dynamical problems presents itself as an interesting alternative to the traditional indirect optimal control. The method relies on the first discretize and then optimize paradigm, where a discretization of th...
This paper is devoted to the study of dimension theory, in particular multifractal analysis, for multimodal maps. We describe the Lyapunov spectrum, generalising previous results by Todd. We also study the multifractal spectrum of pointwise dimensi...
This paper presents a novel approach for optimizing betting strategies in sports gambling by integrating Von Neumann-Morgenstern Expected Utility Theory, deep learning techniques, and advanced formulations of the Kelly Criterion. By combining neural...
We review some recent work by Mannheim and O'Brien on the systematics of galactic rotation curves in the conformal gravity theory. In this work the conformal theory was applied to a comprehensive, high quality sample of spiral galaxies whose rotation...
We study the spectral theory and the resolvent of the vector field generating the frame flow of closed hyperbolic 3-dimensional manifolds on some family of anisotropic Sobolev spaces. We show the existence of a spectral gap and prove resolvent estima...
Gonzo! The Go based TUI log analysis tool (⭐ 2490)
Mel Robbins is the creator and host of The Mel Robbins Podcast, one of the most successful podcasts in the world, and a #1 New York Times bestselling author....
Meet NotebookLM, the AI research tool and thinking partner that can analyze your sources, turn complexity into clarity and transform your content.
We study the complexity of learning mixtures of separated Gaussians with common unknown bounded covariance matrix. Specifically, we focus on learning Gaussian mixture models (GMMs) on $\mathbb{R}^d$ of the form $P= \sum_{i=1}^k w_i \mathcal{N}(\bolds...
We study the complexity of Non-Gaussian Component Analysis (NGCA) in the Statistical Query (SQ) model. Prior work developed a general methodology to prove SQ lower bounds for this task that have been applicable to a wide range of contexts. In particu...
Recently, there has been remarkable progress in reinforcement learning (RL) with general function approximation. However, all these works only provide regret or sample complexity guarantees. It is still an open question if one can achieve stronger pe...
Deep learning models have achieved remarkable success in different areas of machine learning over the past decade; however, the size and complexity of these models make them difficult to understand. In an effort to make them more interpretable, sever...
We provide new insights on eluder dimension, a complexity measure that has been extensively used to bound the regret of algorithms for online bandits and reinforcement learning with function approximation. First, we study the relationship between the...