Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members

BatchVMatrix.cc

Go to the documentation of this file.
00001 // -*- C++ -*- 00002 00003 // PLearn (A C++ Machine Learning Library) 00004 // Copyright (C) 2003 Olivier Delalleau 00005 // 00006 // Redistribution and use in source and binary forms, with or without 00007 // modification, are permitted provided that the following conditions are met: 00008 // 00009 // 1. Redistributions of source code must retain the above copyright 00010 // notice, this list of conditions and the following disclaimer. 00011 // 00012 // 2. Redistributions in binary form must reproduce the above copyright 00013 // notice, this list of conditions and the following disclaimer in the 00014 // documentation and/or other materials provided with the distribution. 00015 // 00016 // 3. The name of the authors may not be used to endorse or promote 00017 // products derived from this software without specific prior written 00018 // permission. 00019 // 00020 // THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR 00021 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00022 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN 00023 // NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00024 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 00025 // TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00026 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00027 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00028 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00029 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00030 // 00031 // This file is part of the PLearn library. For more information on the PLearn 00032 // library, go to the PLearn Web site at www.plearn.org 00033 00034 00035 /* ******************************************************* 00036 * $Id: BatchVMatrix.cc,v 1.5 2004/04/05 22:46:32 morinf Exp $ 00037 ******************************************************* */ 00038 00039 #include "BatchVMatrix.h" 00040 00041 namespace PLearn { 00042 using namespace std; 00043 00044 PLEARN_IMPLEMENT_OBJECT(BatchVMatrix, "ONE LINE DESCR", "VMat class that replicates small parts of a matrix (mini-batches), so that each mini-batch appears twice (consecutively)."); 00045 00047 // declareOptions // 00049 void BatchVMatrix::declareOptions(OptionList& ol) 00050 { 00051 declareOption(ol, "m", &BatchVMatrix::m, OptionBase::buildoption, 00052 " The matrix viewed by the BatchVMatrix\n"); 00053 declareOption(ol, "batch_size", &BatchVMatrix::batch_size, OptionBase::buildoption, 00054 " The size of each mini-batch\n"); 00055 inherited::declareOptions(ol); 00056 } 00057 00059 // makeDeepCopyFromShallowCopy // 00061 void BatchVMatrix::makeDeepCopyFromShallowCopy(map<const void*, void*>& copies) 00062 { 00063 inherited::makeDeepCopyFromShallowCopy(copies); 00064 deepCopyField(m, copies); 00065 } 00066 00068 // build // 00070 void BatchVMatrix::build() 00071 { 00072 inherited::build(); 00073 build_(); 00074 } 00075 00077 // build_ // 00079 void BatchVMatrix::build_() 00080 { 00081 if (m) { 00082 width_ = m->width(); 00083 length_ = m->length() * 2; 00084 fieldinfos = m->getFieldInfos(); 00085 last_batch = (m->length()-1) / batch_size; 00086 last_batch_size = m->length() % batch_size; 00087 if (last_batch_size == 0) 00088 last_batch_size = batch_size; 00089 } 00090 } 00091 00093 // get // 00095 real BatchVMatrix::get(int i, int j) const { 00096 int n_batch = i / (2 * batch_size); 00097 int k = batch_size; 00098 if (n_batch == last_batch) { 00099 // This is the last batch 00100 k = last_batch_size; 00101 } 00102 int i_ = n_batch * batch_size + (i - n_batch * 2 * batch_size) % k; 00103 return m->get(i_, j); 00104 } 00105 00107 // put // 00109 void BatchVMatrix::put(int i, int j, real value) { 00110 int n_batch = i / (2 * batch_size); 00111 int i_ = n_batch * batch_size + (i - n_batch * 2 * batch_size) % batch_size; 00112 m->put(i_, j, value); 00113 } 00114 00115 } // end of namespcae PLearn

Generated on Tue Aug 17 15:48:49 2004 for PLearn by doxygen 1.3.7