{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/binary-classification/papers/25","list_of":"/task/binary-classification","task":"Binary Classification","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":25,"pages_in_order":26,"rows_per_page":100,"rows":[2401,2500],"of":2574,"counts":{"archive_papers_tagged":2574,"with_a_code_link":710,"where_syntology_ran_a_sample":115,"not_listed_spam_title":0,"listed":2574,"listed_where_code_ran":115,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":100,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":100,"listed_every_run_a_failure_of_syntologys_instrument":15,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/binary-classification","prev":"/task/binary-classification/papers/24","next":"/task/binary-classification/papers/26","papers":[{"url":null,"slug":"partial-face-detection-in-the-mobile-domain","title":"Partial Face Detection in the Mobile Domain","date":"2017-04-07","arxiv_id":"1704.02117","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-computational-approach-to-relative","title":"A Computational Approach to Relative Aesthetics","date":"2017-04-05","arxiv_id":"1704.01248","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-task-approach-to-predict-likability","title":"A Multi-task Approach to Predict Likability of Books","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-similarity-functions-for","title":"Learning Similarity Functions for Pronunciation Variations","date":"2017-03-28","arxiv_id":"1703.09817","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-in-graph-based","title":"Uncertainty quantification in graph-based classification of high dimensional data","date":"2017-03-26","arxiv_id":"1703.08816","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-classifier-design-under","title":"Linear classifier design under heteroscedasticity in Linear Discriminant Analysis","date":"2017-03-24","arxiv_id":"1703.08434","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-forests-and-vgg-net-an-algorithm-for","title":"Random Forests and VGG-NET: An Algorithm for the ISIC 2017 Skin Lesion Classification Challenge","date":"2017-03-15","arxiv_id":"1703.05148","repositories_listed":0,"syntology":null},{"url":null,"slug":"dont-fear-the-bit-flips-optimized-coding","title":"Don't Fear the Bit Flips: Optimized Coding Strategies for Binary Classification","date":"2017-03-08","arxiv_id":"1703.02641","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-rates-for-classification-with","title":"Learning rates for classification with Gaussian kernels","date":"2017-02-28","arxiv_id":"1702.08701","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-modified-construction-for-a-support-vector","title":"A Modified Construction for a Support Vector Classifier to Accommodate Class Imbalances","date":"2017-02-08","arxiv_id":"1702.02555","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-classification-in-high","title":"Weakly Supervised Classification in High Energy Physics","date":"2017-02-01","arxiv_id":"1702.00414","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-reject-and-refine-options-in-multicategory","title":"On Reject and Refine Options in Multicategory Classification","date":"2017-01-09","arxiv_id":"1701.02265","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-and-learning-to-rank","title":"Classification and Learning-to-rank Approaches for Cross-Device Matching at CIKM Cup 2016","date":"2016-12-20","arxiv_id":"1612.07117","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-based-eeg-speech-models","title":"Neural networks based EEG-Speech Models","date":"2016-12-16","arxiv_id":"1612.05369","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-of-data-driven-mathematical-laws-for","title":"Design of Data-Driven Mathematical Laws for Optimal Statistical Classification Systems","date":"2016-12-12","arxiv_id":"1612.03902","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-bayesian-label-prediction-on-a-1","title":"Nonparametric Bayesian label prediction on a graph","date":"2016-12-06","arxiv_id":"1612.01930","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-temporal-model-for-multiple-sclerosis","title":"A temporal model for multiple sclerosis course evolution","date":"2016-12-02","arxiv_id":"1612.00615","repositories_listed":0,"syntology":null},{"url":null,"slug":"adverse-drug-reaction-classification-with","title":"Adverse Drug Reaction Classification With Deep Neural Networks","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-with-abstention","title":"Boosting with Abstention","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cogalex-v-shared-task-ghhh-detecting-semantic","title":"CogALex-V Shared Task: GHHH - Detecting Semantic Relations via Word Embeddings","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-annotation-of-sentence-parts","title":"Selective Annotation of Sentence Parts: Identification of Relevant Sub-sentential Units","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-learning-through-the-lens-of","title":"Supervised learning through the lens of compression","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-unlabeled-data-for-neural","title":"Exploiting Unlabeled Data for Neural Grammatical Error Detection","date":"2016-11-28","arxiv_id":"1611.08987","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-can-be-predicted-from-six-seconds-of","title":"What Can Be Predicted from Six Seconds of Driver Glances?","date":"2016-11-26","arxiv_id":"1611.08754","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-approximations-for-generalized","title":"Scalable Approximations for Generalized Linear Problems","date":"2016-11-21","arxiv_id":"1611.06686","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-comparing-survival-curves-between-two","title":"Why comparing survival curves between two subgroups may be misleading","date":"2016-11-04","arxiv_id":"1611.01480","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-classification-with-complex-metrics","title":"Online Classification with Complex Metrics","date":"2016-10-23","arxiv_id":"1610.07116","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-statistical-learning-via-the-lens-of","title":"On statistical learning via the lens of compression","date":"2016-10-12","arxiv_id":"1610.03592","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-classification-of-multi-channel-eeg","title":"Binary classification of multi-channel EEG records based on the $ε$-complexity of continuous vector functions","date":"2016-10-05","arxiv_id":"1610.01633","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-ensemble-learning-for-outlier","title":"Sequential Ensemble Learning for Outlier Detection: A Bias-Variance Perspective","date":"2016-09-18","arxiv_id":"1609.05528","repositories_listed":0,"syntology":null},{"url":null,"slug":"very-simple-classifier-a-concept-binary","title":"Very Simple Classifier: a Concept Binary Classifier toInvestigate Features Based on Subsampling and Localility","date":"2016-09-14","arxiv_id":"1609.04321","repositories_listed":0,"syntology":null},{"url":null,"slug":"earthquake-magnitude-prediction-in-hindukush","title":"Earthquake magnitude prediction in Hindukush region using machine learning techniques","date":"2016-09-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-probabilistic-optimum-path-forest","title":"A Probabilistic Optimum-Path Forest Classifier for Binary Classification Problems","date":"2016-09-04","arxiv_id":"1609.00878","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoding-visual-stimuli-in-human-brain-by","title":"Decoding visual stimuli in human brain by using Anatomical Pattern Analysis on fMRI images","date":"2016-09-04","arxiv_id":"1609.00921","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-landscape-of-empirical-risk-for-non","title":"The Landscape of Empirical Risk for Non-convex Losses","date":"2016-07-22","arxiv_id":"1607.06534","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-task-deep-network-for-person-re","title":"A Multi-task Deep Network for Person Re-identification","date":"2016-07-19","arxiv_id":"1607.05369","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-quasi-newton-methods-for-nonconvex","title":"Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization","date":"2016-07-05","arxiv_id":"1607.01231","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-analytical-approach-to-consistency-and","title":"A new analytical approach to consistency and overfitting in regularized empirical risk minimization","date":"2016-07-01","arxiv_id":"1607.00274","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetric-and-antisymmetric-properties-of","title":"Symmetric and antisymmetric properties of solutions to kernel-based machine learning problems","date":"2016-06-27","arxiv_id":"1606.08501","repositories_listed":0,"syntology":null},{"url":null,"slug":"nn-grams-unifying-neural-network-and-n-gram","title":"NN-grams: Unifying neural network and n-gram language models for Speech Recognition","date":"2016-06-23","arxiv_id":"1606.07470","repositories_listed":0,"syntology":null},{"url":null,"slug":"holistic-features-for-real-time-crowd","title":"Holistic Features For Real-Time Crowd Behaviour Anomaly Detection","date":"2016-06-16","arxiv_id":"1606.05310","repositories_listed":0,"syntology":null},{"url":null,"slug":"logarithmic-time-one-against-some","title":"Logarithmic Time One-Against-Some","date":"2016-06-15","arxiv_id":"1606.04988","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-birth-least-squares-support-vector","title":"Multiple birth least squares support vector machine for multi-class classification","date":"2016-06-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"contour-detection-in-unstructured-3d-point","title":"Contour Detection in Unstructured 3D Point Clouds","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-equivalence-between-kolmogorov-smirnov","title":"On the equivalence between Kolmogorov-Smirnov and ROC curve metrics for binary classification","date":"2016-06-01","arxiv_id":"1606.00496","repositories_listed":0,"syntology":null},{"url":"/paper/ordinal-regression-with-multiple-output-cnn","slug":"ordinal-regression-with-multiple-output-cnn","title":"Ordinal Regression With Multiple Output CNN for Age Estimation","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"utu-at-semeval-2016-task-10-binary","title":"UTU at SemEval-2016 Task 10: Binary Classification for Expression Detection (BCED)","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-tm-cleaning-through-mt-and-pos","title":"Automatic TM Cleaning through MT and POS Tagging: Autodesk's Submission to the NLP4TM 2016 Shared Task","date":"2016-05-19","arxiv_id":"1605.05906","repositories_listed":0,"syntology":null},{"url":null,"slug":"affective-lexicon-creation-for-the-greek","title":"Affective Lexicon Creation for the Greek Language","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-in-persian-handwritten-letters","title":"A New Approach in Persian Handwritten Letters Recognition Using Error Correcting Output Coding","date":"2016-04-26","arxiv_id":"1604.07554","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-gaussian-processes-for-supervised","title":"Scalable Gaussian Processes for Supervised Hashing","date":"2016-04-25","arxiv_id":"1604.07335","repositories_listed":0,"syntology":null},{"url":null,"slug":"reverse-engineering-and-symbolic-knowledge","title":"Reverse Engineering and Symbolic Knowledge Extraction on Łukasiewicz Fuzzy Logics using Linear Neural Networks","date":"2016-04-11","arxiv_id":"1604.02774","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-flow-for-multi-class-and-binary","title":"A generalized flow for multi-class and binary classification tasks: An Azure ML approach","date":"2016-03-26","arxiv_id":"1603.08070","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-streaming-algorithm-for-crowdsourced-data","title":"A Streaming Algorithm for Crowdsourced Data Classification","date":"2016-02-23","arxiv_id":"1602.07107","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-lower-bounds-for-realizable","title":"Minimax Lower Bounds for Realizable Transductive Classification","date":"2016-02-09","arxiv_id":"1602.03027","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-algorithms-from-pool-to-stream","title":"Interactive algorithms: from pool to stream","date":"2016-02-02","arxiv_id":"1602.01132","repositories_listed":0,"syntology":null},{"url":null,"slug":"some-experimental-issues-in-financial-fraud","title":"Some Experimental Issues in Financial Fraud Detection: An Investigation","date":"2016-01-06","arxiv_id":"1601.01228","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-utility-of-abstaining-in-binary","title":"The Utility of Abstaining in Binary Classification","date":"2015-12-26","arxiv_id":"1512.08133","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-rates-of-sub-sampled-newton","title":"Convergence rates of sub-sampled Newton methods","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-classification-rates-for-high","title":"Fast Classification Rates for High-dimensional Gaussian Generative Models","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-a-descriptor-specific-3d-keypoint","title":"Learning a Descriptor-Specific 3D Keypoint Detector","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predtron-a-family-of-online-algorithms-for","title":"Predtron: A Family of Online Algorithms for General Prediction Problems","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-correlation-between-labels-to","title":"Exploring Correlation between Labels to improve Multi-Label Classification","date":"2015-11-25","arxiv_id":"1511.07953","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-classifier-calibration-using-an","title":"Binary Classifier Calibration using an Ensemble of Near Isotonic Regression Models","date":"2015-11-16","arxiv_id":"1511.05191","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-class-imbalance-in-link-prediction","title":"Handling Class Imbalance in Link Prediction using Learning to Rank Techniques","date":"2015-11-13","arxiv_id":"1511.04383","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovery-radiomics-via-stochasticnet","title":"Discovery Radiomics via StochasticNet Sequencers for Cancer Detection","date":"2015-11-11","arxiv_id":"1511.03361","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-multiclass-support","title":"Performance Analysis of Multiclass Support Vector Machine Classification for Diagnosis of Coronary Heart Diseases","date":"2015-11-07","arxiv_id":"1511.02352","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-renyi-classifiers","title":"Discrete Rényi Classifiers","date":"2015-11-05","arxiv_id":"1511.01764","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-gibbs-newton-technique-for-enhanced","title":"A 'Gibbs-Newton' Technique for Enhanced Inference of Multivariate Polya Parameters and Topic Models","date":"2015-10-22","arxiv_id":"1510.06646","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-optimization-of-top-k-precision","title":"Transductive Optimization of Top k Precision","date":"2015-10-20","arxiv_id":"1510.05976","repositories_listed":0,"syntology":null},{"url":null,"slug":"functional-frank-wolfe-boosting-for-general","title":"Functional Frank-Wolfe Boosting for General Loss Functions","date":"2015-10-09","arxiv_id":"1510.02558","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-knowledge-gradient-with-logistic-belief","title":"The Knowledge Gradient with Logistic Belief Models for Binary Classification","date":"2015-10-08","arxiv_id":"1510.02354","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-in-the-presence-of-outliers-adaptive","title":"Boosting in the presence of outliers: adaptive classification with non-convex loss functions","date":"2015-10-05","arxiv_id":"1510.01064","repositories_listed":0,"syntology":null},{"url":null,"slug":"supersizing-self-supervision-learning-to","title":"Supersizing Self-supervision: Learning to Grasp from 50K Tries and 700 Robot Hours","date":"2015-09-23","arxiv_id":"1509.06825","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-binary-classification-with-single-layer","title":"On Binary Classification with Single-Layer Convolutional Neural Networks","date":"2015-09-13","arxiv_id":"1509.03891","repositories_listed":0,"syntology":null},{"url":null,"slug":"neyman-pearson-classification-under-high","title":"Neyman-Pearson Classification under High-Dimensional Settings","date":"2015-08-13","arxiv_id":"1508.03106","repositories_listed":0,"syntology":null},{"url":null,"slug":"alevs-active-learning-by-statistical-leverage","title":"ALEVS: Active Learning by Statistical Leverage Sampling","date":"2015-07-15","arxiv_id":"1507.04155","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-single-trial-eeg-evoked-potential","title":"Detecting single-trial EEG evoked potential using a wavelet domain linear mixed model: application to error potentials classification","date":"2015-06-25","arxiv_id":"1506.07627","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-interpretability-of-conditional","title":"On the Interpretability of Conditional Probability Estimates in the Agnostic Setting","date":"2015-06-09","arxiv_id":"1506.03018","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-rates-of-active-learning-for","title":"Convergence Rates of Active Learning for Maximum Likelihood Estimation","date":"2015-06-08","arxiv_id":"1506.02348","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-an-oracle-that-reports-auc-scores","title":"Exploiting an Oracle that Reports AUC Scores in Machine Learning Contests","date":"2015-06-03","arxiv_id":"1506.01339","repositories_listed":0,"syntology":null},{"url":null,"slug":"some-open-problems-in-optimal-adaboost-and","title":"Some Open Problems in Optimal AdaBoost and Decision Stumps","date":"2015-05-26","arxiv_id":"1505.06999","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-methods-for-classification-with","title":"Diffusion Methods for Classification with Pairwise Relationships","date":"2015-05-22","arxiv_id":"1505.06072","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relation-between-accuracy-and-fairness","title":"On the relation between accuracy and fairness in binary classification","date":"2015-05-21","arxiv_id":"1505.05723","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-least-squares-twin-support-vector","title":"Fuzzy Least Squares Twin Support Vector Machines","date":"2015-05-20","arxiv_id":"1505.05451","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-of-active-learning-with-uniform","title":"An Analysis of Active Learning With Uniform Feature Noise","date":"2015-05-15","arxiv_id":"1505.04215","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-decision-theoretic-classification","title":"Optimal Decision-Theoretic Classification Using Non-Decomposable Performance Metrics","date":"2015-05-07","arxiv_id":"1505.01802","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-regret-bounds-for-generalized","title":"Surrogate regret bounds for generalized classification performance metrics","date":"2015-04-27","arxiv_id":"1504.07272","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-lexical-syntactic-and-semantic","title":"Exploring Lexical, Syntactic, and Semantic Features for Chinese Textual Entailment in NTCIR RITE Evaluation Tasks","date":"2015-04-08","arxiv_id":"1504.02150","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-model-aggregation-via-stochastic","title":"Active Model Aggregation via Stochastic Mirror Descent","date":"2015-03-28","arxiv_id":"1503.08363","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-bounds-for-the-majority-vote-from-a-pac","title":"Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm","date":"2015-03-28","arxiv_id":"1503.08329","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-labeled-classification-of-demographic","title":"Multi-Labeled Classification of Demographic Attributes of Patients: a case study of diabetics patients","date":"2015-03-26","arxiv_id":"1503.07795","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-predictive-properties-of-binary-link","title":"On the Predictive Properties of Binary Link Functions","date":"2015-02-16","arxiv_id":"1502.04742","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-invariants-using-decision-trees","title":"Learning Invariants using Decision Trees","date":"2015-01-20","arxiv_id":"1501.04725","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed","title":"Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss","date":"2015-01-01","arxiv_id":"1501.00263","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-sparsity-in-multi-class-linear","title":"Exploring Sparsity in Multi-class Linear Discriminant Analysis","date":"2014-12-26","arxiv_id":"1412.7983","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirically-estimable-classification-bounds","title":"Empirically Estimable Classification Bounds Based on a New Divergence Measure","date":"2014-12-19","arxiv_id":"1412.6534","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiobjective-optimization-of-classifiers-by","title":"Multiobjective Optimization of Classifiers by Means of 3-D Convex Hull Based Evolutionary Algorithm","date":"2014-12-18","arxiv_id":"1412.5710","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-streaming-support-vector-machines","title":"Accurate Streaming Support Vector Machines","date":"2014-12-08","arxiv_id":"1412.2485","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-optimization-of-ams-by-logistic","title":"Consistent optimization of AMS by logistic loss minimization","date":"2014-12-05","arxiv_id":"1412.2106","repositories_listed":0,"syntology":null}],"record_sha256":"162592fd03b029a79de339a94bf52a590f4682f6e57d70ac828b04cca241d4b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}