This paper introduces MOCM for better fMRI analysis stability.
problem Stable performance of MVP models on new fMRI datasets.
method Integrated objective function and multi-objective optimization approach.
result Superior performance compared to other techniques.
The paper introduces a dynamic MVP model using high-frequency financial data.
problem Capturing the dynamics of minimum variance portfolio weights in financial markets.
method Imposes autoregressive structure on MVP processes and uses CLIME and LASSO for estimation.
result Proposes DR-MVP model with established asymptotic properties.
Multivariate Pattern (MVP) classification can map different cognitive states to the brain tasks. One of the main challenges in MVP analysis is validating the generated results across subjects. However, analyzing multi-subject fMRI data requires accurate functional alignments between neuronal activities of different sub…
The multivariate probit model (MVP) is a popular classic model for studying binary responses of multiple entities. Nevertheless, the computational challenge of learning the MVP model, given that its likelihood involves integrating over a multidimensional constrained space of latent variables, significantly limits its a…
SHA improves fMRI alignment for cognitive state discovery.
problem Optimal functional alignment in MVP analysis for multi-subject fMRI data.
method Supervised Hyperalignment (SHA) method that maximizes correlation within same categories and minimizes between distinct categories.
result SHA achieves up to 19% better performance for multi-class problems.
The paper analyzes time-inconsistent strategies in financial markets with rough volatility.
problem Time-inconsistency in financial markets with rough volatility.
method Functional Itô calculus and game-theoretic framework to solve path-dependent Hamilton-Jacobi-Bellman equations.
result Explicit solutions to MVP problems under rough volatility, showing performance benefits.
In this short report, we discuss how coordinate-wise descent algorithms can be used to solve minimum variance portfolio (MVP) problems in which the portfolio weights are constrained by l q l_{q} l q norms, where 1 ≤ q ≤ 2 1\leq q \leq 2 1 ≤ q ≤ 2 . A portfolio which weights are regularised by such norms is called a sparse portfolio (Brodie et …
Multivariate Pattern (MVP) classification holds enormous potential for decoding visual stimuli in the human brain by employing task-based fMRI data sets. There is a wide range of challenges in the MVP techniques, i.e. decreasing noise and sparsity, defining effective regions of interest (ROIs), visualizing results, and…
We solve the paradox of score-based methods by minimizing path variance.
problem Score-based methods are path-dependent, leading to inaccurate and unstable estimators.
method Propose MVP Principle to minimize path variance, derive closed-form expression, and use flexible Kumaraswamy Mixture Model.
result Establishes new state-of-the-art results on challenging benchmarks.
Study compares three portfolio optimization methods on Indian stocks.
problem Optimizing portfolios for the Indian stock market.
method Three portfolio optimization methods (MVP, HRP, HERC) applied to 15 sectors.
result Identified portfolios with highest cumulative return, lowest volatility, and best Sharpe Ratio.
This study compares three portfolio design approaches for stock selection.
problem Designing a profitable portfolio with precise stock returns and risks.
method Three portfolio design approaches: mean-variance portfolio, hierarchical risk parity, and autoencoder-based portfolio.
result Autoencoder portfolios outperform MVP on annual returns, but MVP is best on risk-adjusted returns.
Improved analysis of UCBVI algorithm with better empirical performance.
problem Improving the UCBVI algorithm's performance and understanding its bounds.
method Refined analysis of UCBVI algorithm with improved bonus terms and regret analysis.
result Improving multiplicative constants in UCBVI bounds enhances empirical performance.
New algorithm reduces reinforcement learning complexity, approaching contextual bandits.
problem Episodic reinforcement learning's difficulty compared to contextual bandits.
method Proposes MVP algorithm with a new Bernstein-type bonus for episodic reinforcement learning.
result Achieves near-optimal regret bound of $O\left(\left(\sqrt{SAK} + S^2A
ight) \poly\log \left(SAHK
ight)
ight)$ , improving state-of-the-art results.
The Lagrangian representation of multi-Hamiltonian PDEs has been introduced by Y. Nutku and one of us (MVP). In this paper we focus on systems which are (at least) bi-Hamiltonian by a pair A 1 A_1 A 1 , A 2 A_2 A 2 , where A 1 A_1 A 1 is a hydrodynamic-type Hamiltonian operator. We prove that finding the Lagrangian representation is equiv…
This study compares three portfolio optimization methods on Indian stocks.
problem Comparing portfolio optimization methods on Indian stocks.
method Mean-Variance, Hierarchical Risk Parity, and Reinforcement Learning approaches.
result Reinforcement Learning outperformed other methods in terms of Sharpe ratio.
New algorithms reduce regret in both stochastic and deterministic environments.
problem Designing algorithms that perform well in both types of MDPs.
method Proposed new environment norms and algorithms with variance-dependent regret bounds.
result First algorithm with simultaneously optimal bounds for both stochastic and deterministic MDPs.
Improved reinforcement learning for episodes with varying action sets.
problem Reinforcement learning with context-dependent action sets.
method Extends MVP algorithm to handle adversarial and stochastic contexts.
result Established minimax regret bounds of O ( S A H 3 K log L ) O(\sqrt{SAH^3K\log L}) O ( S A H 3 K log L ) for adversarial contexts. End-to-end framework optimizes financial metrics using neural networks.
problem Difficult portfolio optimization in financial markets due to non-stationarity and high costs.
method Directly optimizes differentiable financial metrics via neural networks, incorporating realistic costs and rebalancing.
result Best model achieves +7.86% total return, outperforming S&P 500 by 12.38 percentage points.
Study benchmarks cryptocurrency risk using GBM, revealing Lognormal limitations.
problem Tackles limitations of Lognormal assumption in modeling cryptocurrency volatility and VaR.
method Applies Geometric Brownian Motion (GBM) with Maximum Likelihood Estimation and correlated Monte Carlo Simulation.
result Observed limitations of Lognormal assumption in cryptocurrency volatility and VaR calculations.
New algorithm reduces MDP regret by accounting for state suboptimality gaps and variance.
problem Reducing regret in episodic MDPs with varying state suboptimality gaps.
method Introduced MVP algorithm with variance-aware gap-dependent regret bound.
result Achieved a variance-aware gap-dependent regret bound for MDPs.
Paper presents a new framework for sequence classification.
problem Sequence classification in real-world applications.
method Reference-based sequence classification framework.
result New sequence classification algorithms achieve comparable accuracy.
Dual-stage sEMG classification improves gesture recognition accuracy.
problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.
A novel method for classification with rejection using ensemble of cost-sensitive classifiers.
problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.
The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…
Few-shot image classification is improved by correcting CNNs' texture bias.
problem Few-shot image classification performance is hindered by CNNs' texture bias.
method Corrected CNNs' texture bias using a simpler method than state-of-the-art approaches.
result State-of-the-art performance on miniImageNet task achieved.
Paper introduces LPCs for robust classification with performance bounds.
problem Conventional classification techniques constrain rules and use surrogate losses.
method Robust risk minimization (RRM) for unconstrained classification rules, optimizing 0-1 loss.
result LPCs provide performance bounds and competitive performance with state-of-the-art techniques.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Paper compares XGB and BPNN for music style classification.
problem Efficient music style classification using different methods.
method Feature extraction for timbral texture, rhythmic content, and pitch content; comparative evaluation of XGB and BPNN.
result XGB outperforms BPNN for small datasets in music classification.
Deep reinforcement learning improves classification accuracy for imbalanced datasets.
problem Imbalanced datasets challenge conventional classification algorithms.
method Formulated as a sequential decision-making process, solved using deep Q-learning network.
result Proposed model outperforms other imbalanced classification algorithms.
Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.
problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.
C-HMCNN(h) improves HMC classification by leveraging class hierarchy.
problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.
Advances few-shot classification by treating it as supervised learning and proposing new training techniques.
problem Formulating the ability of humans to learn from limited data in machine learning.
method Formulated few-shot classification as a supervised learning problem and introduced multi-episode and cross-way training techniques.
result Proposed training strategies accelerate the training process without accuracy loss.
Improves NILM with multi-label SRC, outperforming state-of-the-art.
problem Non-intrusive load monitoring (NILM) for energy disaggregation.
method Modified multi-label sparse representation based classification (SRC).
result Significant improvement over state-of-the-art techniques with minimal training data.
New approach improves classification guarantees by focusing on direction rather than regression risk.
problem Improving classification guarantees in binary classification problems.
method Establishing a geometric distinction between classification and regression, leveraging scale invariance.
result Improved guarantees for classification risk compared to regression risk.
Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.
problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$ .
New method for robust trajectory classification without parameters.
problem Trajectory classification accuracy and robustness.
method Parameter-free approach to find best trajectory partition and dimension combination.
result Promising preliminary results show improved robustness.
We study realizations of Lie algebras by vector fields. A correspondence between classification of transitive local realizations and classification of subalgebras is generalized to the case of regular local realizations. A reasonable classification problem for general realizations is rigorously formulated and an algori…
A new network-based high-level data classification method using betweenness centrality.
problem Traditional data classification techniques focus on physical features, while high-level classification considers semantic meaning.
method Proposes a network-based high-level classification technique using betweenness centrality.
result Competent classification performance in nine real datasets compared to traditional models.
Adversaries reprogram text classification models without changing the original network.
problem Reprogramming neural networks trained on discrete input spaces like text classification.
method Context-based vocabulary remapping model for white-box and black-box settings.
result Successfully repurposed various text-classification models for new tasks.
This thesis evaluates text-based vs audio-based classification of mental health interviews.
problem Classifying psychiatric illness using text-based methods.
method Design and evaluate a text classification network on mental health interviews, using belabBERT.
result Text-based classification is a strong alternative to audio-based methods.
Study on error probability for classification of heavy-tailed renewal processes.
problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.
This review explores resampling techniques for imbalanced binary classification.
problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.
Directly compute classification by learning features with class scores.
problem Classification efficiency and accuracy on various datasets.
method PCA for feature encoding, supervised learning model with encoder-decoder structure.
result Effective classification performance on multiple datasets.
This paper tackles tweet classification by identifying purpose and position.
problem Difficulties in determining user intention and attitude in short, informal tweets.
method Transformed tweet classification into a multi-label problem and applied a multi-label classification method with post-processing.
result The method effectively classifies tweet purpose and position, outperforming individual classification methods.
Text classification on drug SMILES strings yields competitive drug type classification results.
problem Classifying drug types using conventional text classification methods.
method Treated drug SMILES as sentences and applied basic NLP methods for classification.
result Competitive drug type classification results achieved.
BERT improves fine-grained sentiment classification.
problem Fine-grained sentiment classification of text.
method Used BERT for fine-grained sentiment classification.
result BERT outperforms other models for fine-grained sentiment classification.
Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.
problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.
CRCEN neural network tackles imbalanced classification.
problem Challenges in training conventional classifiers on imbalanced datasets.
method CRCEN neural network with a novel weighted cross entropy loss function.
result CRCEN outperforms baseline models on benchmark datasets.