Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

10203040 · May 202619922001200920172026
48 results for Piano Composition

Transformer improves pop piano composition by incorporating beat-based structure.

problem Generating expressive pop piano compositions with coherent rhythmic structure.
method Improved data representation for Transformers, incorporating beat-bar-phrase structure.
result Composes pop piano music with better rhythmic structure than existing models.

We present Piano Genie, an intelligent controller which allows non-musicians to improvise on the piano. With Piano Genie, a user performs on a simple interface with eight buttons, and their performance is decoded into the space of plausible piano music in real time. To learn a suitable mapping procedure for this proble…

2018-10-11abs ↗pdf ↗

PIANO speeds up multinomial logistic regression solving.

problem Handling large datasets and many classes in logistic regression.
method Parallel iterative algorithm based on Majorization Minimization.
result PIANO converges to a stationary point of Multinomial and Sparse Multinomial Logistic Regression.

Music relies heavily on repetition to build structure and meaning. Self-reference occurs on multiple timescales, from motifs to phrases to reusing of entire sections of music, such as in pieces with ABA structure. The Transformer (Vaswani et al., 2017), a sequence model based on self-attention, has achieved compelling …

2018-09-12abs ↗pdf ↗

We advance the state of the art in polyphonic piano music transcription by using a deep convolutional and recurrent neural network which is trained to jointly predict onsets and frames. Our model predicts pitch onset events and then uses those predictions to condition framewise pitch predictions. During inference, we r…

2017-10-30abs ↗pdf ↗

We present a supervised neural network model for polyphonic piano music transcription. The architecture of the proposed model is analogous to speech recognition systems and comprises an acoustic model and a music language model. The acoustic model is a neural network used for estimating the probabilities of pitches in …

2015-08-07abs ↗pdf ↗

A semi-recurrent hybrid VAE-GAN model for generating sequential data is introduced. In order to consider the spatial correlation of the data in each frame of the generated sequence, CNNs are utilized in the encoder, generator, and discriminator. The subsequent frames are sampled from the latent distributions obtained b…

2018-06-01abs ↗pdf ↗

We propose a novel model for temporal detection and localization which allows the training of deep neural networks using only counts of event occurrences as training labels. This powerful weakly-supervised framework alleviates the burden of the imprecise and time-consuming process of annotating event locations in tempo…

2019-05-17abs ↗pdf ↗

This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with segments of equal size, the composite dimension can be expressed as a function …

2014-07-10abs ↗pdf ↗

New geometric approach for analyzing compositional data like gut microbiomes.

problem Analyzing non-negative compositional data with relative values only.
method Reinterpret compositional data as quotient topology of a sphere, using spherical harmonics and reflection group actions.
result Construction of Reproducing Kernel Hilbert Space (RKHS) for compositional data.

Study on deep neural networks using branching processes and Mehler's formula.

problem Understanding the mathematical role of activation functions in compositional neural networks.
method Connection between compositional kernels and branching processes via Mehler's formula; new random features algorithm.
result Explicit formulas for eigenvalues of compositional kernels quantify complexity.

We establish conditions for compositional generalization in machine learning.

problem Achieving compositional generalization in machine learning models.
method We reformulate compositionality as a property of the data-generating process and derive mild conditions on the training distribution and model architecture.
result Our theoretical framework enables compositional generalization under mild conditions.

Develops methods for causal inference in compositional data using instrumental variables.

problem Interpreting summary statistics like diversity indices as causal effects in compositional data.
method Statistical data transformations and regression techniques tailored for compositional data.
result Advantages and limitations of the proposed methods demonstrated on synthetic and real microbiome data.

In classical field theory, the composite fibred manifolds Y -> Z -> X provides the adequate mathematical formulation of gauge models with broken symmetries, e.g., the gauge gravitation theory. This work is devoted to connections on composite fibred manifolds. In particular, we get the horizontal splitting of the vertic…

1994-12-17abs ↗pdf ↗

The p-index improves investment performance for NYSE stocks but not for SSE stocks.

problem Improving investment performance for stocks using the p-index.
method Comparing different p-ratio strategies and empirical efficient frontiers for SSE and NYSE stocks.
result The p-index enhances investment performance for NYSE stocks but not for SSE stocks.

Model predicts composite structures assembly quality with input uncertainty.

problem Accurate prediction of dimensional deviations and residual stress in composite structures assembly.
method Neural Network Gaussian Process considering input uncertainty.
result NNGPIU model outperforms other methods for nonsmooth, nonlinear responses.

New algorithm reduces complexity for optimizing complex machine learning tasks.

problem Optimizing complex machine learning objectives like reinforcement learning and portfolio management.
method Developed SARAH-Compositional algorithm using Stochastic Recursive Gradient Descent.
result Achieved optimal IFO complexity bounds for stochastic compositional optimization.

This paper introduces compositional data analysis for financial ratios, improving industry-level analysis.

problem Statistical issues with standard financial ratios at industry level.
method Compositional data analysis techniques for financial ratios.
result Improved analysis of financial ratios using compositional data methods.

Study challenges neural models in compositional learning tasks.

problem Challenges in neural models for compositional and relational learning.
method Introduced ConceptWorld environment for generating images from compositional concepts, tested various neural architectures.
result Neural models struggle with longer compositional chains and substitutivity tests.

SCL discovers compositional structures in analogical reasoning tasks.

problem Discovering compositional structures in analogical reasoning tasks like Raven's Progressive Matrices.
method Proposes Scattering Compositional Learner (SCL) that composes neural networks in sequence.
result Achieves state-of-the-art performance on RPM datasets with significant improvements.

Paper develops momentum schemes with variance reduction for non-convex composition optimization.

problem Lack of convergence guarantee and efficient momentum design in existing algorithms.
method Develops various momentum schemes with SPIDER-based variance reduction.
result Achieves near-optimal sample complexity and linear convergence rate.

Model estimates foreign exchange reserve compositions of undisclosed central banks.

problem Limited information on central bank reserve compositions hinders analysis.
method Hidden Markov Model relating portfolio valuation to exchange rates.
result China's reserve composition likely matches global average, while Singapore holds fewer US dollars.

In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of this, we propose a notion of abelian n-gerbe theory

2001-05-24abs ↗pdf ↗

A new geometry-preserving method for interpreting compositional data.

problem Statistical challenges in high-dimensional compositional data.
method Geometry-preserving framework for dimension reduction of compositional data.
result Identification of a central compositional subspace for compositional predictors.

Using quilted Floer cohomology and relative quilt invariants, we define a composition functor for categories of Lagrangian correspondences in monotone and exact symplectic Floer theory. We show that this functor agrees with geometric composition in the case that the composition is smooth and embedded. As a consequence …

2007-08-21abs ↗pdf ↗

This paper extends compositional data analysis using graph signal processing.

problem Traditional log-ratios between all variables are not suitable for specific variable relationships.
method Linking compositional data analysis with graph signal processing, it considers only selected log-ratios.
result The approach retains desirable properties of scale invariance and compositional coherence.

New samplers improve compositional generation with diffusion models.

problem Improving compositional generation with diffusion models.
method Score-based interpretation, energy-based parameterization, Metropolis-corrected samplers.
result New samplers enable successful compositional generation across various tasks.

NeSS combines neural and symbolic approaches for better compositional generalization.

problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.

The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.

problem Understanding the tunnel and bridge numbers of composite genus 2 spatial graphs.
method Analyzes connected sum and trivalent vertex sum operations on genus 2 spatial graphs, proving bounds for tunnel and bridge numbers.
result Sharp bounds for the tunnel number of composite genus 2 spatial graphs, including lower bounds for bridge numbers.

Paper analyzes stability and generalization of SCO algorithms.

problem Understanding how SCO algorithms perform on unseen data.
method Algorithmic stability analysis in statistical learning theory.
result Derives dimension-independent excess risk bounds for SCGD and SCSC.