Defines basic sections of LA-groupoids for simpler modeling.
problem Modeling sections of stacky Lie algebroids.
method Introduces basic sections with injective core-anchor map.
result Basic sections are Morita invariant and equivalent to multiplicative sections.
Noise increases the Rashomon ratio, leading simpler models to perform similarly to complex ones.
problem Why simpler models perform similarly to complex models on noisy datasets.
method Analyzed the data generation process and model training choices, introduced pattern diversity.
result Noisier datasets lead to larger Rashomon ratios, explaining simpler models' performance.
A simpler proof for apex graphs in McCarty and Thomas' conjecture.
problem Proving a conjecture about apex graphs and their linklessly embeddable properties.
method Shorter and simpler proof for the apex case.
result A shorter and simpler proof for the apex case of the conjecture.
Transformers prefer simpler explanations in hierarchical tasks.
problem Navigating tasks with varying complexity levels.
method Well-controlled testbeds based on Markov chains and linear regression.
result Transformers favor the least complex sufficient explanation when presented with simpler data.
Simpler proof for Kielak's virtual fibering criterion.
problem Virtual fibering criterion for RFRS groups
method Simpler proof
result Simplified proof of Kielak's criterion
Simpler algorithm learns shallow networks faster.
problem Learning a linear combination of ReLU activations.
method A simpler one-stage algorithm with improved runtime.
result Runs in (d/ε)O(k2) time. Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model interpretability of tree ensembles. After learning a complex tree ensembles in a s…
Hybrid LSTM-fully convolutional networks (LSTM-FCN) for time series classification have produced state-of-the-art classification results on univariate time series. We show that replacing the LSTM with a gated recurrent unit (GRU) to create a GRU-fully convolutional network hybrid model (GRU-FCN) can offer even better p…
We define a new Hurwitz problem which is essentially a small core of the simple Hurwitz problem. The corresponding Hurwitz numbers have simpler formulae, satisfy effective recursion relations and determine the simple Hurwitz numbers. We also apply this idea of finding a smaller simpler enumerative problem to orbifold H…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact C1 manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary differential topology. The role played by curvatures in this construction is also…
Simpler, faster algorithm for uniformity testing in the shuffle model.
problem Testing uniformity of data in the shuffle model with privacy constraints.
method Simplified analysis and use of privacy amplification via shuffling.
result An algorithm with the same guarantees but simpler and more streamlined.
Reduces constructing multiplicative connections to simpler tasks.
problem Constructing multiplicative connections on proper Lie groupoids.
method Reduction to simpler tasks involving proper and regular Lie groupoids.
result Simpler methods for constructing multiplicative connections.
SGD tends to favor simpler subnetworks, improving generalization.
problem SGD's tendency to favor simpler subnetworks over complex ones.
method Identifying invariant sets and analyzing SGD's behavior around them.
result SGD collapses networks to simpler subnetworks, improving generalization.
We present new stochastic differential equations, that are more general and simpler than the existing Ito-based stochastic differential equations. As an example, we apply our approach to the investment (portfolio) model.
A new method creates simpler, more interpretable decision trees from complex ensembles.
problem Complex tree ensembles reduce interpretability and control over machine learning models.
method Dynamic-programming based algorithm for finding a minimum-size decision tree.
result Optimal born-again trees are simpler and more interpretable than original ensembles.
A very simple R3 realization of the Möbius strip, significantly simpler than the common one, is given. For any, however large width/length ratio of the strip, it is shown that this realization, in contrast with the common one, is the union of a vertical segment and the graph of a simple rational function on …
Simpler proof for non-basic sets in 2D.
problem Proving non-basic sets in 2D.
method Defining Sternfeld arrays and proving non-basic sets.
result Simpler proof of non-basic sets in 2D.
Simplified proof for Frank and Lieb's inequality on Heisenberg group.
problem Proving the sharp Frank-Lieb inequality on the Heisenberg group.
method Simpler proof based on 2nd variation of subcritical functionals.
result A simpler proof of the inequality without the need for minimizer existence.
Simpler model outperforms deep learning for disease prediction.
problem Challenges of deep learning models in interpretability and feasibility.
method Developed a simpler tree-based model for EHR data.
result Improved performance over deep learning models while maintaining interpretability.
Paper uses GMM and MAF for probabilistic classification, outperforming simpler models.
problem Classifying data with complex distributions.
method Density estimation using Gaussian Mixture Model and Masked Autoregressive Flow.
result Proposed classifiers outperform simpler models like linear discriminant analysis.
Energy-based models can generate complex images by combining simpler concepts.
problem Generating natural images that satisfy complex logical combinations of concepts.
method Energy-based models combine probability distributions of simpler concepts to generate compositions.
result Energy-based models can generate images that satisfy conjunctions, disjunctions, and negations of concepts.
Improved model for multivariate time series prediction with simpler architecture.
problem Multivariate probabilistic time series prediction challenges.
method Simplified transformer-based attentional copulas (TACTiS) with linearly scalable parameters.
result Significantly better training dynamics and state-of-the-art performance.
New seq2seq model can copy entire spans, outperforming simpler models in editing tasks.
problem Editing documents or source code using seq2seq models with explicit token copying.
method Extended seq2seq model capable of copying entire input spans to output in one step, new training and inference methods.
result New model consistently outperforms simpler baselines in editing tasks of natural language and source code.
Simpler classifiers are more robust to adversarial perturbations.
problem Vulnerability of deep neural networks to small adversarial perturbations.
method Investigating the connection between simplicity and robustness in classifiers.
result Simpler classifiers (fewer output classes) are less susceptible to adversarial perturbations.
Simpler method detects trivial rational 3-tangle.
problem Detecting trivial rational 3-tangle.
method Bridge arc replacement method.
result Simpler method detects trivial rational 3-tangle.
Most existing interpretable methods explain a black-box model in a post-hoc manner, which uses simpler models or data analysis techniques to interpret the predictions after the model is learned. However, they (a) may derive contradictory explanations on the same predictions given different methods and data samples, and…
A new method for creating simpler models from complex ones.
problem Creating accurate approximations of complex models at reduced costs.
method Sequential adaptive surrogate modeling based on locally spectral expansions.
result Stochastic spectral embedding (SSE) shows good approximation capabilities and scalability.
The study examines how automorphism growth rates of a group can be deduced from its simpler decompositions.
problem Determine automorphism growth rates of a group from its simpler decompositions.
method Analyze group decompositions into simpler pieces (direct products, free products, graph of groups) and deduce growth rates.
result Information about automorphism growth rates of a group can be deduced from its simpler decompositions.
In Bayesian classification, it is important to establish a probabilistic model for each class for likelihood estimation. Most of the previous methods modeled the probability distribution in the whole sample space. However, real-world problems are usually too complex to model in the whole sample space; some fundamental …
Simpler algorithms for morphing planar and toroidal graphs.
problem Constructing smooth transitions between isomorphic drawings of planar and toroidal graphs.
method Barycentric interpolation and scaling strategy.
result Simplified and more natural morphs with improved computational efficiency.
It is almost always easier to find an accurate-but-complex model than an accurate-yet-simple model. Finding optimal, sparse, accurate models of various forms (linear models with integer coefficients, decision sets, rule lists, decision trees) is generally NP-hard. We often do not know whether the search for a simpler m…
Pixel-space diffusion models outperform latent models on high-resolution image synthesis.
problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.
Over the last few years, graph autoencoders (AE) and variational autoencoders (VAE) emerged as powerful node embedding methods, with promising performances on challenging tasks such as link prediction and node clustering. Graph AE, VAE and most of their extensions rely on multi-layer graph convolutional networks (GCN) …
Machine learning factors outperform traditional portfolio optimization methods.
problem Comparing machine learning and traditional portfolio optimization methods.
method Examined machine learning and factor-based portfolio optimization using autoencoder neural networks and dimensionality reduction techniques.
result Minimum-variance portfolios using latent factors derived from autoencoders and sparse methods outperform simpler benchmarks in risk minimization.
Breaks down complex nonlinear dynamics into simpler components.
problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.
Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.
problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.
We sharply characterize the performance of different penalization schemes for the problem of selecting the relevant variables in the multi-task setting. Previous work focuses on the regression problem where conditions on the design matrix complicate the analysis. A clearer and simpler picture emerges by studying the No…
High-dimensional models can outperform simpler ones in causal inference.
problem Estimating average treatment effects with many covariates.
method High-dimensional linear regression and synthetic control with many control units.
result Adding more control units can improve imputation performance even when pre-treatment fit is perfect.
Sphere eversions have been described so far by either pictures with minimal topological complexity, numerical evolution or complex equations. We write down relatively simple explicit formulas for the whole eversion, both analytic and topologically simpler, including also Boy surface (real projective plane), using a fam…
We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.
Contrastive learning struggles with class collapse and feature suppression, revealing bias towards simpler solutions.
problem Contrastive learning struggles with class collapse and feature suppression, especially in supervised and unsupervised settings.
method Unified theoretical framework to determine which features are learnt by CL, revealing bias towards simpler solutions.
result Bias towards simpler solutions is a key factor in class collapse and feature suppression.
Proposes a simpler method for quantifying uncertainty in time-series with volatility clustering.
problem Uncertainty quantification for time-series with volatility clustering.
method Proposes a Scale Mixture Distribution to quantify return forecast uncertainty in neural networks.
result The proposed method provides a favorable complexity-accuracy trade-off and separates model parameters into subnetworks.
New method trains neural ODEs faster with fewer layers.
problem Training neural ODEs on large datasets is computationally expensive.
method Combines optimal transport and stability regularizations.
result Significant reductions in training time with no performance loss.
We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient to achieve an acceptable accuracy close to that of the original model. Moreover, …
ARMA cell simplifies neural autoregressive modeling for time series.
problem Complex RNN cells are not always necessary and can be inferior.
method Introduces ARMA cell, a simpler, modular approach for neural time series modeling.
result The ARMA cell is competitive with popular alternatives in performance.
The paper shows how certain complex projective varieties can be broken down into simpler types.
problem Understanding the structure of complex projective varieties with pseudo-effective tangent sheaves.
method Developed a theory of pseudo-effective sheaves and applied the minimal model program.
result Projective klt varieties with pseudo-effective tangent sheaves can be decomposed into Fano varieties and Q-abelian varieties.
In this short note, we prove by an appropriate change of variables that the SVI implied volatility parameterization presented in Gatheral's book and the large-time asymptotic of the Heston implied volatility agree algebraically, thus confirming a conjecture from Gatheral as well as providing a simpler expression for th…
Simpler ε-greedy with longer action durations improves exploration.
problem Limited exploration capability of ε-greedy in complex domains.
method Temporally extended ε-greedy with repeated actions for random durations.
result Temporally extended ε-greedy outperforms sophisticated methods on various domains.